Non-confluence in divisionless P systems with active membranes

We describe a solution to the SAT problem via non-confluent P systems with active membranes, without using membrane division rules. Furthermore, we provide an algorithm for simulating such devices on a nondeterministic Turing machine with a polynomial slowdown. Together, these results prove that the complexity class of problems solvable non-confluently and in polynomial time by this kind of P systems is exactly the class NP. Key words: membrane computing, complexity theory

• Type: Journal
• Year: 2010
• Where: TCS
• Authors: Antonio E. Porreca, Giancarlo Mauri, Claudio Zandron
• Keywords: Membrane Division Rules, Nondeterministic Turing Machine, Polynomial Slowdown, TCS 2010, Theoretical Computer Science