Journal ArticleDOI
Complexity classes in models of cellular computing with membranes
TLDR
Four complexity classes for cellular computing systems with membranes are introduced and the usefulness of these classes is illustrated by solving two NP–completeproblems, namely HPP and SAT, in both variants of P systems.Abstract:
In this paper we introduce four complexity classes for cellular computing systems with membranes: the first and the second ones contain all decision problems solvable in polynomial time by a family of deterministic P systems, without and with an input membrane, respectively; the third and fourth classes contain all decision problems solvable in polynomial time by a family of non-deterministic P systems, without and with an input membrane, respectively. We illustrate the usefulness of these classes by solving two NP–complete problems, namely HPP and SAT, in both variants of P systems.read more
Citations
More filters
Journal ArticleDOI
A polynomial complexity class in P systems using membrane division
TL;DR: The complexity class PMCF of all decision problems solvable in polynomial time by a family of P systems belonging to a given class of membrane systems with input, F, is introduced and it is shown that the class NP is contained in the above mentioned complexity class.
Journal Article
Solving a PSPACE-complete problem by recognizing P systems with restricted active membranes
TL;DR: This paper partially confirms the conjecture proving that dissolving rules are not necessary for non-elementary membrane division, and the construction of a semi-uniform family of P systems is confirmed.
Journal ArticleDOI
Trading polarizations for labels in P systems with active membranes
TL;DR: The universality of P systems with active membranes which are allowed to change the labels of membranes, but do not use polarizations is obtained, and it is proved that SAT can be solved in linear time by systems without polarizations and with label changing possibilities.
Journal ArticleDOI
Membrane computing and complexity theory: A characterization of PSPACE
TL;DR: It is shown that confluent P systems with active membranes solve in polynomial time exactly the class of problems PSPACE, suggesting that the class PSPACE provides a tight upper bound on the computational potential of biological information processing models.
Journal ArticleDOI
Simulation of P systems with active membranes on CUDA
José M. Cecilia,José M. García,Ginés D. Guerrero,Miguel A. Martínez-del-Amor,Ignacio Pérez-Hurtado,Mario J. Pérez-Jiménez +5 more
TL;DR: This paper compares the high performance parallel simulator for the GPU to the simulator developed on a single CPU, and shows that the GPU is better suited than the CPU to simulate P systems due to its highly parallel nature.
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.
Book
Membrane Computing: An Introduction
TL;DR: This chapter discusses Membrane Computing, What It Is and What It is Not, and attempts to get back to reality with open problems and Universality results.
Modelos de computación celular con membranas
M.J. Pérez,A. Romero,F. Sancho +2 more
TL;DR: In this article, a modelo decomputacion no convencional (los sistemas celulares con membranas), inspired by la estructura y funcionamiento de las celulas de los organismos vivos, se desarrolla una teoria de la complejidad computacional en dicho modelo that permite dar una nueva caracterizacion de la relacion P NP.
Book ChapterDOI
Decision P Systems and the P!=NP Conjecture
TL;DR: The main result is that if there exists an NP-complete problem that cannot be solved in polynomial time, with respect to the input length, by a deterministic decision P system constructed in Poole's theorem, then P ?
Dissertation
Complejidad y Universalidad en Modelos de Computación Celular.
TL;DR: Four complexity classes for cellular computing systems with membranes are introduced and the usefulness of these classes is illustrated by solving two NP�completeproblems, namely HPP and SAT, in both variants of P systems.