Abstract
The mutual mobile membrane systems represent a variant of mobile membrane systems in which the endocytosis and exocytosis work whenever the involved membranes "agree" on the movement (this agreement is described by using dual objects a and in the involved membranes). We study the computational power of this variant of mobile membrane systems, proving that only three membranes are enough to get the same computational power as a Turing machine. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Aman, B., & Ciobanu, G. (2009). Turing completeness using three mobile membranes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5715 LNCS, pp. 42–55). https://doi.org/10.1007/978-3-642-03745-0_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
