Solving a PSPACE-complete problem with cP systems

There have been a few NP-hard problems solved using cP systems including the travelling salesman problem. However, these problems are typically in NP rather than higher in the polynomial time hierarchy. In this paper, we solve QSAT (also known as TQBF), which is a well-known PSPACE-complete problem. Compared to other extant confluent P systems solutions, our deterministic cP solution only uses a small constant number of custom alphabet symbols (19), a small constant number of rules (10) and a small constant upper limit of membrane nesting depth (6), independent of the problem size.

[1]  Artiom Alhazov,et al.  Uniform Solution to QSAT Using Polarizationless Active Membranes , 2006 .

[2]  Giancarlo Mauri,et al.  Characterizing PSPACE with shallow non-confluent P systems , 2019, J. Membr. Comput..

[3]  Radu Nicolescu,et al.  The Hamiltonian Cycle and Travelling Salesman Problems in cP Systems , 2019, Fundam. Informaticae.

[4]  Gheorghe Paun,et al.  Computing with Membranes , 2000, J. Comput. Syst. Sci..

[5]  Radu Nicolescu,et al.  Parallel Thinning with Complex Objects and Actors , 2014, Int. Conf. on Membrane Computing.

[6]  Gheorghe Paun.  P Systems with Active Membranes: Attacking NP-Complete Problems , 2001, J. Autom. Lang. Comb..

[7]  Radu Nicolescu,et al.  An Introduction to cP Systems , 2018, Enjoying Natural Computing.

[8]  Giancarlo Mauri,et al.  Solving QSAT in Sublinear Depth , 2018, Int. Conf. on Membrane Computing.

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

[10]  Alfonso Rodríguez-Patón,et al.  Tissue P systems , 2003, Theor. Comput. Sci..

[11]  Eitan M. Gurari,et al.  Introduction to the theory of computation , 1989 .

[12]  Radu Nicolescu,et al.  Actor-Like cP Systems , 2018, Int. Conf. on Membrane Computing.

[13]  N. L. Sarda,et al.  Conclusion and future work , 2021, Digital Methods and Tools to Support Healthy Ageing.

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

[15]  Radu Nicolescu,et al.  Formal verification of cP systems using PAT3 and ProB , 2020, J. Membr. Comput..

[16]  Mario J. Pérez-Jiménez,et al.  A Linear Solution for QSAT with Membrane Creation , 2005, Workshop on Membrane Computing.