Computing with Membranes

  • Authors:

  • Gheorghe Paun

  • Affiliations:

  • -

  • Venue:
  • Computing with Membranes
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

We introduce a new computability model, of a distributed parallel type, based on the notion of a membrane structure. Such a structure consists of several cell-like membranes, recurrently placed inside a unique "skin" membrane. A plane representation is a Wenn diagram without intersected sets and with a unique superset. In the regions delimited by the membranes there are placed objects; the obtained construct is called a super-cell. These objects are assumed to evolve: each object can be transformed in other objects, can pass through a membrane, or can disolve the membrane in which it is placed. A priority relation between evolution rules can be considered. The evolution is done in parallel for all objects able to evolve. In this way, we obtain a computing device (we call it a super-cell system): start with a certain number of objects in a certain membrane and let the system evolve; if it will halt (no object can further evolve), then the computation is finished, with the result given as the number of objects in a specified membrane. If the development of the system goes for ever, then the computation fails to have an output. We prove that the super-cell systems with the possibility of objects to cooperate characterize the recursively enumerable sets of natural numbers; moreover, systems with only two membranes suffice. In fact, we do not need cooperation, but we only use catalysts, specified objects which are present in the evolution rules but are not modified by the rule application. One catalyst suffices. A variant is also considered, with the objects being strings over a given alphabet. The evolution rules are now based on string transformations. We investigate the case when either the rewriting operation from Chomsky grammars (with respect to context-free productions) or the splicing operation from H systems investigated in the DNA computing is used. In both cases, characterizations of recursively enumerable languages are obtained by very simple super-cell systems: with three membranes in the rewriting case and four in the splicing case. Several open problems and directions for further research are formulated.