Turing Complete Neural Computation Based on Synaptic Plasticity

0510528 - ÚI 2020 RIV US eng J - Článek v odborném periodiku
Cabessa, Jérémie
Turing Complete Neural Computation Based on Synaptic Plasticity.
PLoS ONE. Roč. 14, č. 10 (2019), č. článku e0223451. ISSN 1932-6203. E-ISSN 1932-6203
Grant CEP: GA ČR(CZ) GA19-05704S
Institucionální podpora: RVO:67985807
Klíčová slova: Action potentials * Language * Machine learning algorithms * Neurons * Recurrent neural networks * Synapses * Synaptic plasticity * Neural pathways
Obor OECD: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Impakt faktor: 2.740, rok: 2019
Způsob publikování: Open access

In neural computation, the essential information is generally encoded into the neurons via their spiking configurations, activation values or (attractor) dynamics. The synapses and their associated plasticity mechanisms are, by contrast, mainly used to process this information and implement the crucial learning features. Here, we propose a novel Turing complete paradigm of neural computation where the essential information is encoded into discrete synaptic states, and the updating of this information achieved via synaptic plasticity mechanisms. More specifically, we prove that any 2-counter machine—and hence any Turing machine—can be simulated by a rational-weighted recurrent neural network employing spike-timing-dependent plasticity (STDP) rules. The computational states and counter values of the machine are encoded into discrete synaptic strengths. The transitions between those synaptic weights are then achieved via STDP. These considerations show that a Turing complete synaptic-based paradigm of neural computation is theoretically possible and potentially exploitable. They support the idea that synapses are not only crucially involved in information processing and learning features, but also in the encoding of essential information. This approach represents a paradigm shift in the field of neural computation.
Trvalý link: http://hdl.handle.net/11104/0300985