Polynomial Complexity Classes in Spiking Neural P Systems

We study the computational potential of spiking neural (SN) P systems. several intractable problems have been proven to be solvable by these systems in polynomial or even constant time. We study first their formal aspects such as the input encoding, halting versus spiking, and descriptional complexity. Then we establish a formal platform for complexity classes of uniform families of confluent recognizer SN P systems. Finally, we present results characterizing the computational power of several variants of confluent SN P systems, characterized by classes ranging from P to PSPACE.

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

[2]  Wei-Ngan Chin,et al.  A new algorithm for regularizing one-letter context-free grammars , 2003, Theor. Comput. Sci..

[3]  Alfonso Rodríguez-Patón,et al.  Spiking Neural P Systems: Stronger Normal Forms , 2009, Int. J. Unconv. Comput..

[4]  Gheorghe Paun,et al.  The Oxford Handbook of Membrane Computing , 2010 .

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

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

[7]  Turlough Neary.  On the computational complexity of spiking neural P systems , 2010, Natural Computing.

[8]  Giancarlo Mauri,et al.  Uniform solutions to SAT and Subset Sum by spiking neural P systems , 2008, Natural Computing.

[9]  Xiangxiang Zeng,et al.  Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources , 2010, Theor. Comput. Sci..

[10]  Mario J. Pérez-Jiménez,et al.  A Polynomial Complexity Class in P Systems Using Membrane Division , 2003, DCFS.

[11]  Mario J. Pérez-Jiménez.  A Computational Complexity Theory in Membrane Computing , 2009, Workshop on Membrane Computing.

[12]  Gheorghe Paun,et al.  Spike Trains in Spiking Neural P Systems , 2006, Int. J. Found. Comput. Sci..

[13]  Miguel Ángel Gutiérrez Naranjo,et al.  Solving Numerical NP-complete Problems by Spiking Neural P Systems With Pre-computed Resources , 2008 .

[14]  Mario de Jesús Pérez Jiménez,et al.  A computational complexity theory in membrane computing , 2009 .