Synfire rings are neural circuits capable of conveying synchronous, temporally precise and self-sustained activities in a robust manner. We propose a cell assembly based paradigm for abstract neural computation centered on the concept of synfire rings. More precisely, we empirically show that Hodgkin-Huxley neural networks modularly composed of synfire rings are automata complete. We provide an algorithmic construction which, starting from any given finite state automaton, builds a corresponding Hodgkin-Huxley neural network modularly composed of synfire rings and capable of simulating it. We illustrate the correctness of the construction on two specific examples. We further analyze the stability and robustness of the construction as a function of changes in the ring topologies as well as with respect to cell death and synaptic failure mechanisms, respectively. These results establish the possibility of achieving abstract computation with bio-inspired neural networks. They might constitute a theoretical ground for the realization of biological neural computers.

Institute of Computer Science of the Czech Academy of Sciences P O Box 5 18207 Prague 8 Czech Republic

Institute of Physiology Philipps University of Marburg 35037 Marburg Germany

Laboratory of Mathematical Economics and Applied Microeconomics Université Paris 2 Panthéon Assas 75005 Paris France

Citace poskytuje Crossref.org