Computational completeness of tissue p systems with conditional uniport

  • Authors:
  • Sergey Verlan;Francesco Bernardini;Marian Gheorghe;Maurice Margenstern

  • Affiliations:
  • LACL, Département Informatique, Université Paris 12, Crétiel, France;Leiden Institute of Advanced Computer Science, Universiteit Leiden, Leiden, CA, The Netherlands;Department of Computer Science, The University of Sheffield, Sheffield, UK;UFR MIM, LITA, Université Paul Verlaine -Metz, Metz Cédex, France

  • Venue:
  • WMC'06 Proceedings of the 7th international conference on Membrane Computing
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

The paper introduces (purely communicative) tissue P systems with conditional uniport. Conditional uniport means that rules move only one object at a time, but this may be with the help of another one acting as an activator which is left untouched in the place where it is. Tissue P systems with conditional uniport are shown to be computationally complete in the sense that they can recognize all recursively enumerable sets of natural numbers. This is achieved by simulating deterministic register machines.