Membrane Computing: An Introduction
Membrane Computing: An Introduction
On the time complexity of 2-tag systems and small universal Turing machines
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Fundamenta Informaticae
Four small universal turing machines
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Solving numerical NP-complete problems with spiking neural P systems
WMC'07 Proceedings of the 8th international conference on Membrane computing
P-completeness of cellular automaton rule 110
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
On the computational complexity of spiking neural P systems
Natural Computing: an international journal
Polynomial complexity classes in spiking neural P systems
CMC'10 Proceedings of the 11th international conference on Membrane computing
Selected topics in computational complexity of membrane systems
Computation, cooperation, and life
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
| Hi-index | 0.00 |
It is shown 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 polynomial time and has only 18 neurons.