Open AccessJournal Article
P systems with active membranes: attacking NP-complete problems
TLDR
It is proved that a class of P systems whose membranes are the main active components, in the sense that they directly mediate the evolution and the communication of objects, is not only computationally universal, but also able to solve NP complete problems in polynomial time.Abstract:
P systems are parallel Molecular Computing models based on processing multisets of objects in cell-like membrane structures. Various variants were already shown to be computationally universal, equal in power to Turing machines. In this paper one proposes a class of P systems whose membranes are the main active components, in the sense that they directly mediate the evolution and the communication of objects. Moreover, the membranes can multiply themselves by division. We prove that this variant is not only computationally universal, but also able to solve NP complete problems in polynomial (actually, linear) time. We exemplify this assertion with the well-known SAT problem.read more
Citations
More filters
Journal ArticleDOI
Computing with Membranes
TL;DR: It is proved that the P systems with the possibility of objects to cooperate characterize the recursively enumerable sets of natural numbers; moreover, systems with only two membranes suffice.
Journal ArticleDOI
A guide to membrane computing
Gheorghe Paun,Grzegorz Rozenberg +1 more
TL;DR: The present paper presents the basic ideas of computing with membranes and some fundamental properties (mostly concerning the computational power and efficiency) of P systems of various types.
Book ChapterDOI
Introduction to Membrane Computing
TL;DR: This is a comprehensive (and friendly) introduction to membrane computing (MC), meant to offer both computer scientists and non-computer scientists an up-to-date overview of the field.
Journal Article
A Quantum-Inspired Evolutionary Algorithm Based on P systems for Knapsack Problem
TL;DR: Experimental results show that this evolutionary algorithm performs better than quantum-inspired evolutionary algorithms, for certain arrangements of the compartments of the P system structure utilized.
Journal ArticleDOI
P systems with minimal parallelism
TL;DR: If at least a rule from a set of rules associated with a membrane or a region can be used, then at least one rule from that membrane or region must be used , without any other restriction, and this minimal parallelism leads to universality.
References
More filters
Journal ArticleDOI
Computing with Membranes
TL;DR: It is proved that the P systems with the possibility of objects to cooperate characterize the recursively enumerable sets of natural numbers; moreover, systems with only two membranes suffice.
Journal Article
On the Power of Membrane Computing
Jürgen Dassow,Gheorghe Paun +1 more
TL;DR: This work compares transition super-cell systems with classic mechanisms in formal language theory, context-free and matrix grammars, E0L and ET0L systems, interpreted as generating mechanisms of number relations (the authors take the Parikh image of the usual language generated by these mechanisms rather than the language).