On the Power of Computing with Proteins on Membranes
- 385 Downloads
P systems with proteins on membranes are inspired closely by switching protein channels. This model of membrane computing using membrane division has been previously shown to solve an NP-complete problem in polynomial time. In this paper we characterize the class of problems solvable by these P systems in polynomial time and we show that it equals PSPACE. Therefore, these P systems are computationally equivalent (up to a polynomial time reduction) to the alternating Turing machine or the PRAM computer. The proof technique we employ reveals also some interesting trade-offs between certain P system properties, as antiport rules, membrane labeling by polarization or the presence of proteins.
KeywordsPolynomial Time Turing Machine Division Rule Membrane Computing Polynomial Time Reduction
Unable to display preview. Download preview PDF.
- 1.Alberts, B., Johnson, A., Lewis, J., Raff, M., Roberts, K., Walter, P.: Molecular Biology of the Cell, 4th edn. Garland Science, New York (2002)Google Scholar
- 4.Frisco, P.: Computing with Cells. In: Advances in Membrane Computing. Oxford University Press, Oxford (2009)Google Scholar
- 9.Pérez-Jiménez, M.J.: A computational complexity theory in membrane computing. In: Păun, G., Pérez-Jiménez, M.J., Riscos-Núnez, A. (eds.) Tenth Workshop on Membrane Computing (WMC10), RGNC Report 3/2009, Sevilla, pp. 82–105. Universidad de Sevilla (2009)Google Scholar
- 12.van Emde Boas, P.: Machine models and simulations. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. A, pp. 1–66. Elsevier, Amsterdam (1990)Google Scholar
- 13.The P systems web page, http://ppage.psystems.eu/