A boundary between universality and non-universality in extended spiking neural p systems

Authors:
Turlough Neary
Affiliations:
Boole Centre for Research in Informatics, University College Cork, Ireland
Venue:
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Year:
2010

Citing 5
Cited 1

Small universal register machines

Theoretical Computer Science - Special issue on universal machines and computations
Spiking Neural P Systems

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
A note on small universal spiking neural p systems

WMC'09 Proceedings of the 10th international conference on Membrane Computing

On the computational complexity of spiking neural P systems

Natural Computing: an international journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We solve the problem of finding the smallest possible universal spiking neural P system with extended rules. We give a universal spiking neural P system with extended rules and only 4 neurons. This is the smallest possible universal system of its kind. We prove this by showing that the set of problems solved by spiking neural P systems with 3 neurons is bounded above by NL, and so there exists no such universal system with 3 neurons (for any reasonable definition of universality). Finally, we show that if we generalise the output technique we can give a universal spiking neural P system with extended rules that has only 3 neurons. This is also the smallest possible universal system of its kind.