P Systems with Proteins on Membranes and Membrane Division

In this paper we present a method for solving the NP-complete SAT problem using the type of P systems that is defined in [9]. The SAT problem is solved in O(nm) time, where n is the number of boolean variables and m is the number of clauses for a instance written in conjunctive normal form. Thus we can say that the solution for each given instance is obtained in linear time. We succeeded in solving SAT by a uniform construction of a deterministic P system which uses rules involving objects in regions, proteins on membranes, and membrane division. We also investigate the computational power of the systems with proteins on membranes and show that the universality can be reached even in the case of systems that do not even use the membrane division and have only one membrane.

[1]  Luca Cardelli,et al.  Brane Calculi , 2004, CMSB.

[2]  Artiom Alhazov,et al.  Communicative P Systems with Minimal Cooperation , 2004, Workshop on Membrane Computing.

[3]  Oscar H. Ibarra,et al.  Counting Time in Computing with Cells , 2005, DNA.

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

[5]  Alberto Leporati,et al.  A Family of P Systems which Solve 3-SAT , 2005 .

[6]  Andrei Paun,et al.  P Systems with Proteins on Membranes , 2006, Fundam. Informaticae.

[7]  Marvin Minsky,et al.  Computation : finite and infinite machines , 2016 .

[8]  Nadia Busi,et al.  On the Computational Power of the Mate/Bud/Drip Brane Calculus: Interleaving vs. Maximal Parallelism , 2005, Workshop on Membrane Computing.