Recent complexity-theoretic results on P systems with active membranes

2013 ◽  
Vol 25 (4) ◽  
pp. 1047-1071 ◽  
Author(s):  
Giancarlo Mauri ◽  
Alberto Leporati ◽  
Antonio E. Porreca ◽  
Claudio Zandron
Keyword(s):  
P Systems ◽  
Active Membranes

scholarly journals An Efficient Simulation of Polynomial-Space Turing Machines by P Systems with Active Membranes

2010 ◽  
pp. 461-478 ◽  
Author(s):  
Andrea Valsecchi ◽  
Antonio E. Porreca ◽  
Alberto Leporati ◽  
Giancarlo Mauri ◽  
Claudio Zandron
Keyword(s):  
P Systems ◽  
Polynomial Space ◽  
Turing Machines ◽  
Efficient Simulation ◽  
Active Membranes

P Systems with Active Membranes, Without Polarizations and Without Dissolution: A Characterization of P

2005 ◽  
pp. 105-116 ◽  
Author(s):  
Miguel A. Gutiérrez-Naranjo ◽  
Mario J. Pérez-Jiménez ◽  
Agustín Riscos-Núñez ◽  
Francisco J. Romero-Campero
Keyword(s):  
P Systems ◽  
Active Membranes

Simulation of P Systems with Active Membranes on CUDA

2009 ◽  
Author(s):  
José María Cecilia Canales ◽  
José Manuel García Carrasco ◽  
Ginés David Guerrero Hernandez ◽  
Miguel Ángel Martínez del Amor ◽  
Ignacio Pérez Hurtado de Mendoza ◽  
...  
Keyword(s):  
P Systems ◽  
Active Membranes

scholarly journals COMPUTATION OF RAMSEY NUMBERS BY P SYSTEMS WITH ACTIVE MEMBRANES

2011 ◽  
Vol 22 (01) ◽  
pp. 29-38 ◽  
Author(s):  
LINQIANG PAN ◽  
DANIEL DÍAZ-PERNIL ◽  
MARIO J. PÉREZ-JIMÉNEZ
Keyword(s):  
Membrane Computing ◽  
P Systems ◽  
Ramsey Number ◽  
Ramsey Numbers ◽  
Combinatorial Object ◽  
Active Membranes ◽  
Number Problem ◽  
Decision Version

Ramsey numbers deal with conditions when a combinatorial object necessarily contains some smaller given objects. It is well known that it is very difficult to obtain the values of Ramsey numbers. In this work, a theoretical chemical/biological solution is presented in terms of membrane computing for the decision version of Ramsey number problem, that is, to decide whether an integer n is the value of Ramsey number R(k, l), where k and l are integers.

The computational power of timed P systems with active membranes using promoters

2018 ◽  
Vol 29 (5) ◽  
pp. 663-680 ◽  
Author(s):  
YUEGUO LUO ◽  
HAIJUN TAN ◽  
YING ZHANG ◽  
YUN JIANG
Keyword(s):  
P Systems ◽  
P System ◽  
Computational Power ◽  
Computable Set ◽  
Complete Problem ◽  
Active Membranes ◽  
New Variant ◽  
Uniform Solution ◽  
Bioinspired Computing ◽  
Computing Models

P systems with active membranes are a class of bioinspired computing models, where the rules are used in the non-deterministic maximally parallel manner. In this paper, first, a new variant of timed P systems with active membranes is proposed, where the application of rules can be regulated by promoters with only two polarizations. Next, we prove that any Turing computable set of numbers can be generated by such a P system in the time-free way. Moreover, we construct a uniform solution to the$\mathcal{SAT}$problem in the framework of such recognizer timed P systems in polynomial time, and the feasibility and effectiveness of the proposed system is demonstrated by an instance. Compared with the existing methods, the P systems constructed in our work require fewer necessary resources and RS-steps, which show that the solution is effective toNP-complete problem.

scholarly journals On the power of P systems with active membranes using weak non-elementary membrane division

2021 ◽  
Author(s):  
Zsolt Gazdag ◽  
Károly Hajagos ◽  
Szabolcs Iván
Keyword(s):  
Polynomial Time ◽  
P Systems ◽  
Computational Power ◽  
Complete Problems ◽  
Active Membranes ◽  
Membrane Division ◽  
Elementary Membrane

AbstractIt is known that polarizationless P systems with active membranes can solve $$\mathrm {PSPACE}$$ PSPACE -complete problems in polynomial time without using in-communication rules but using the classical (also called strong) non-elementary membrane division rules. In this paper, we show that this holds also when in-communication rules are allowed but strong non-elementary division rules are replaced with weak non-elementary division rules, a type of rule which is an extension of elementary membrane divisions to non-elementary membranes. Since it is known that without in-communication rules, these P systems can solve in polynomial time only problems in $$\mathrm {P}^{\text {NP}}$$ P NP , our result proves that these rules serve as a borderline between $$\mathrm {P}^{\text {NP}}$$ P NP and $$\mathrm {PSPACE}$$ PSPACE concerning the computational power of these P systems.

Sign in / Sign up

Export Citation Format

Share Document