Simulating Turing Machines by P systems with External Output

TitleSimulating Turing Machines by P systems with External Output
Publication TypeJournal Papers
Year of Publication2002
AuthorsPérez-Jiménez, M. J., & Romero-Jiménez Á.
Journal TitleFundamenta Informaticae
PublisherIOS Press
Place PublishedWarsaw, Poland

In [3] a variant of the computation model introduced by Gh. Paun in [1] is considered: membrane systems with external output, which were proven to be universal, in the sense that they are able to generate all Parikh images of recursively enumerable languages. Here we give another proof of the universality of this model. The proof is carried out associating to each deterministic Turing machine a P system with external output that simulates its running. Thus, although we work with symbol-objects, we get strings as a result of computations, and in this way we generate directly all reeursively enumerable languages, instead of their images through Parikh mapping, as it is done in [3].

KeywordsMembrane computing, Natural computing, turing machines
ISSN Number0169-2968