The Computational Power of Exponential-Space P Systems with Active Membranes

Abstract

We show that exponential-space P systems with active membranes characterize the complexity class EXPSPACE. This result is proved by simulating Turing machines working in exponential space via uniform families of P systems with restricted elementary active membranes; the simulation is e cient, in the sense that the time and space required are at most polynomial with respect to the resources employed by the simulated Turing machine.