Turing Completeness Using Three Mobile Membranes

摘要

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 a 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.