Computing with Membranes (P Systems): Universality Results

  • Authors:
  • Carlos Martin-Vide;Gheorghe Paun

  • Affiliations:
  • -;-

  • Venue:
  • MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

This is a survey of universality results in the area of Membrane Computing (P systems), at the level of December 2000. We consider both P systems with symbol-objects and with string-objects; in the latter case, we consider systems based on rewriting, splicing, as well as rewriting together with other operations (replication, crossingover), with sets or with multisets of strings. Besides recalling characterizations of recursively enumerable languages and of recursively enumerable sets of vectors of natural numbers, we also briefly discuss the techniques used in the proofs of such results. Several open problems are also formulated.