Computational power of symport/antiport: history, advances, and open problems

  • Authors:

  • Artiom Alhazov;Rudolf Freund;Yurii Rogozhin

  • Affiliations:

  • Research Group on Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain;Faculty of Informatics, Vienna University of Technology, Vienna, Austria;Institute of Mathematics and Computer Science, of the Academy of Sciences of Moldova, Chişinău, Moldova

  • Venue:
  • WMC'05 Proceedings of the 6th international conference on Membrane Computing
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

We first give a historical overview of the most important results obtained in the area of P systems and tissue P systems with symport/antiport rules, especially with respect to the development of computational completeness results improving descriptional complexity parameters. We consider the number of membranes (cells in tissue P systems), the weight of the rules, and the number of objects. Then we establish our newest results: P systems with only one membrane, symport rules of weight three, and with only seven additional objects remaining in the skin membrane at the end of a halting computation are computationally complete; P systems with minimal cooperation, i.e., P systems with symport/antiport rules of size one and P systems with symport rules of weight two, are computationally complete with only two membranes with only three and six, respectively, superfluous objects remaining in the output membrane at the end of a halting computation.