Tissue p systems with cell separation: upper bound by PSPACE

  • Authors:

  • Petr Sosík;Luděk Cienciala

  • Affiliations:

  • Departamento de Inteligencia Artificial, Facultad de Informática, Universidad Politécnica de Madrid, Boadilla del Monte, Madrid, Spain, Res. Institute of the IT4Innovations Centre of Exc ...;Research Institute of the IT4Innovations Centre of Excellence, Faculty of Philosophy and Science, Silesian University in Opava, Opava, Czech Republic

  • Venue:
  • TPNC'12 Proceedings of the First international conference on Theory and Practice of Natural Computing
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Tissue P systems are a class of bio-inspired computing models motivated by biochemical interactions between cells in a tissue-like arrangement. This organization is formally described by an interaction graph with membranes at its vertices. Membranes communicate by exchanging objects from a finite set. This basic model was enhanced with the operation of cell separation, resulting in tissue P systems with cell separation. Uniform families of tissue P systems were recently studied. Their computational power was shown to range between P and NP&∪co&−NP, characterizing borderlines between tractability and intractability by length of rules and some other features. Here we show that the computational power of these uniform families in polynomial time is limited from above by the class PSPACE. In this way we relate the information-processing potential of bio-inspired tissue-like systems to classical parallel computing models as PRAM or alternating Turing machine.