On the computational complexity of spiking neural P systems

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.

[1]  Oscar H. Ibarra,et al.  On spiking neural P systems , 2006, Natural Computing.

[2]  Ivan Korec,et al.  Small Universal Register Machines , 1996, Theor. Comput. Sci..

[3]  Mihai Ionescu,et al.  On the Efficiency of Spiking Neural P Systems , 2006 .

[4]  Turlough Neary.  A SMALL UNIVERSAL SPIKING NEURAL P SYSTEM , 2008 .

[5]  Giancarlo Mauri,et al.  On the Computational Power of Spiking Neural P Systems , 2007, Int. J. Unconv. Comput..

[6]  Mihai Ionescu,et al.  Some Applications of Spiking Neural P Systems , 2008, Comput. Informatics.

[7]  Turlough Neary.  On the Computational Complexity of Spiking Neural P Systems , 2008, UC.

[8]  Turlough Neary.  A boundary between universality and non-universality in spiking neural P systems , 2009, ArXiv.

[9]  Andrei Paun,et al.  Small universal spiking neural P systems , 2007, Biosyst..

[10]  Giancarlo Mauri,et al.  Solving Numerical NP-Complete Problems with Spiking Neural P Systems , 2007, Workshop on Membrane Computing.

[11]  Turlough Neary.  A Boundary between Universality and Non-universality in Extended Spiking Neural P Systems , 2010, LATA.

[12]  Arnold L. Rosenberg,et al.  Counter machines and counter languages , 1968, Mathematical systems theory.

[13]  L. Pan,et al.  Small universal spiking neural P systems with exhaustive use of rules , 2008, 2008 3rd International Conference on Bio-Inspired Computing: Theories and Applications.

[14]  Gheorghe Paun,et al.  Membrane Computing , 2002, Natural Computing Series.

[15]  Turlough Neary,et al.  Small universal Turing machines , 2008 .

[16]  Gheorghe Paun,et al.  Spiking Neural P Systems with an Exhaustive Use of Rules , 2007, Int. J. Unconv. Comput..

[17]  Xiangxiang Zeng,et al.  Smaller Universal Spiking Neural P Systems , 2008, Fundam. Informaticae.

[18]  Turlough Neary,et al.  P-completeness of Cellular Automaton Rule 110 , 2006, ICALP.

[19]  Rich Schroeppel,et al.  A Two Counter Machine Cannot Calculate 2N , 1972 .

[20]  Turlough Neary,et al.  Four Small Universal Turing Machines , 2007, Fundam. Informaticae.

[21]  Turlough Neary,et al.  Small Weakly Universal Turing Machines , 2007, FCT.