Abstract
We prove that every single-tape deterministic Turing machine working in \(t(n)\) time, for some function \(t:\mathbb {N}\rightarrow \mathbb {N}\), can be simulated by a uniform family of polarizationless P systems with active membranes. Moreover, this is done without significant slowdown in the working time. Furthermore, if \(\log t(n)\) is space constructible, then the members of the uniform family can be constructed by a family machine that uses \(O(\log t(n))\) space.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alhazov, A., Leporati, A., Mauri, G., Porreca, A.E., Zandron, C.: Space complexity equivalence of P systems with active membranes and Turing machines. Theoretical Compuer Science 529, 69–81 (2014)
Murphy, N., Woods, D.: The computational complexity of uniformity and semi-uniformity in membrane systems. In: Martínez-del-Amor, M.A., Orejuela-Pinedo, E.F., Păun, Gh., Pérez-Hurtado, I., Riscos-Núñez, A. (eds.) Seventh Brainstorming Week on Membrane Computing, vol. II, pp. 73–84. Fénix Editora, Sevilla (2009)
Pérez-Jiménez, M.J., Riscos-Núñez, A., Romero-Jiménez, A., Woods, D.: Complexity - membrane division, membrane creation. In: Păun et al. [10], pp. 302–336
Pérez-Jiménez, M.J., Romero-Jiménez, A., Sancho-Caparrini, F.: A polynomial complexity class in P systems using membrane division. In: Csuhaj-Varjú, E., Kintala, C., Wotschke, D., Vaszil, Gy. (eds.) Proceeding of the 5th Workshop on Descriptional Complexity of Formal Systems, DCFS 2003, pp. 284–294 (2003)
Pérez-Jiménez, M.J., Romero-Jiménez, Á., Sancho-Caparrini, F.: A polynomial complexity class in P systems using membrane division. Journal of Automata, Languages and Combinatorics 11(4), 423–434 (2006)
Porreca, A., Leporati, A., Mauri, G., Zandron, C.: Introducing a space complexity measure for P systems. International Journal of Computers, Communications and Control 4(3), 301–310 (2009)
Porreca, A.E.: Computational Complexity Classes for Membrane System. Master’s thesis, Universitá di Milano-Bicocca, Italy (2008)
Porreca, A.E., Leporati, A., Mauri, G., Zandron, C.: Sublinear-space P systems with active membranes. In: Csuhaj-Varjú, E., Gheorghe, M., Rozenberg, G., Salomaa, A., Vaszil, Gy. (eds.) CMC 2012. LNCS, vol. 7762, pp. 342–357. Springer, Heidelberg (2013)
Păun, Gh.: P systems with active membranes: Attacking NP-complete problems. Journal of Automata, Languages and Combinatorics 6(1), 75–90 (2001)
Păun, Gh., Rozenberg, G., Salomaa, A. (eds.): The Oxford Handbook of Membrane Computing. Oxford University Press, Oxford (2010)
Romero Jiménez, A., Pérez-Jiménez, M.J.: Simulating Turing machines by P systems with external output. Fundamenta Informaticae 49(1–3), 273–278 (2002)
Sipser, M.: Introduction to the Theory of Computation. Cengage Learning (2012)
Valsecchi, A., Porreca, A.E., Leporati, A., Mauri, G., Zandron, C.: An efficient simulation of polynomial-space Turing machines by P systems with active membranes. In: Păun, Gh., Pérez-Jiménez, M.J., Riscos-Núñez, A., Rozenberg, G., Salomaa, A. (eds.) WMC 2009. LNCS, vol. 5957, pp. 461–478. Springer, Heidelberg (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Gazdag, Z., Kolonits, G., Gutiérrez-Naranjo, M.A. (2014). Simulating Turing Machines with Polarizationless P Systems with Active Membranes. In: Gheorghe, M., Rozenberg, G., Salomaa, A., Sosík, P., Zandron, C. (eds) Membrane Computing. CMC 2014. Lecture Notes in Computer Science(), vol 8961. Springer, Cham. https://doi.org/10.1007/978-3-319-14370-5_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-14370-5_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-14369-9
Online ISBN: 978-3-319-14370-5
eBook Packages: Computer ScienceComputer Science (R0)