Small universal register machines
Theoretical Computer Science - Special issue on universal machines and computations
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Fundamenta Informaticae
On the Computational Complexity of Spiking Neural P Systems
UC '08 Proceedings of the 7th international conference on Unconventional Computing
Smaller Universal Spiking Neural P Systems
Fundamenta Informaticae
Solving numerical NP-complete problems with spiking neural P systems
WMC'07 Proceedings of the 8th international conference on Membrane computing
A boundary between universality and non-universality in extended spiking neural p systems
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Sequentiality induced by spike number in SNP systems: small universal machines
CMC'11 Proceedings of the 12th international conference on Membrane Computing
| Hi-index | 0.00 |
It is shown here that there is no standard spiking neural P system that simulates Turing machines with less than exponential time and space overheads. The spiking neural P systems considered here have a constant number of neurons that is independent of the input length. Following this, we construct a universal spiking neural P system with exhaustive use of rules that simulates Turing machines in linear time and has only 10 neurons.