P Systems with Active Membranes Characterize PSPACE

P system is a natural computing model inspired by behavior of living cells and their membranes. We show that (semi-)uniform families of P systems with active membranes can solve in polynomial time exactly the class of problems PSPACE. Consequently, these P systems are computationally equivalent (w.r.t. the polynomial time reduction) to standard parallel machine models as PRAM and the alternating Turing machine.

• Type: Conference
• Year: 2006
• Where: DNA
• Authors: Petr Sosík, Alfonso Rodríguez-Patón
• Keywords: Alternating Turing Machine, Bioinformatics, DNA 2006, Polynomial Time, Polynomial Time Reduction