Parallel computation in spiking neural nets

Authors:
Andrew Carnell;Daniel Richardson
Affiliations:
Computer Science, Bath University, Bath BA2 7AY, UK;Computer Science, Bath University, Bath BA2 7AY, UK
Venue:
Theoretical Computer Science
Year:
2007

Citing 5
Cited 1

Communicating sequential processes

Communicating sequential processes
Complexity and real computation

Complexity and real computation
Neural networks and analog computation: beyond the Turing limit

Neural networks and analog computation: beyond the Turing limit
Efficient Event-Driven Simulation of Large Networks of Spiking Neurons and Dynamical Synapses

Neural Computation
Lower bounds for the computational power of networks of spiking neurons

Neural Computation

Parallelization of algorithms with recurrent neural networks

ICANNGA'11 Proceedings of the 10th international conference on Adaptive and natural computing algorithms - Volume Part I

Quantified Score

Hi-index	5.23

Visualization

Abstract

We study the predecessor existence problem for finite discrete dynamical systems. Given a finite discrete dynamical system S and a configuration C, the Predecessor existence (or Pre) problem is to determine whether there is a configuration C^' such that ...