Looking for Simple Common Schemes to Design Recognizer P Systems with Active Membranes That Solve Numerical Decision Problems

2005 ◽  
pp. 94-104
Author(s):  
Carmen Graciani-Díaz ◽  
Agustín Riscos-Núñez
Keyword(s):  
P Systems ◽  
Decision Problems ◽  
Active Membranes

scholarly journals Elementary Active Membranes Have the Power of Counting

2014 ◽  
pp. 194-206
Author(s):  
Antonio E. Porreca ◽  
Alberto Leporati ◽  
Giancarlo Mauri ◽  
Claudio Zandron
Keyword(s):  
Polynomial Time ◽  
P Systems ◽  
Decision Problems ◽  
Active Membranes ◽  
Hard Problems ◽  
Whole Class ◽  
Uniformity Condition ◽  
Membrane Division

P systems with active membranes have the ability of solving computationally hard problems. In this paper, the authors prove that uniform families of P systems with active membranes operating in polynomial time can solve the whole class of PP decision problems, without using nonelementary membrane division or dissolution rules. This result also holds for families having a stricter uniformity condition than the usual one.

scholarly journals Elementary Active Membranes Have the Power of Counting

2011 ◽  
Vol 2 (3) ◽  
pp. 35-48 ◽  
Author(s):  
Antonio E. Porreca ◽  
Alberto Leporati ◽  
Giancarlo Mauri ◽  
Claudio Zandron
Keyword(s):  
Polynomial Time ◽  
P Systems ◽  
Decision Problems ◽  
Active Membranes ◽  
Hard Problems ◽  
Whole Class ◽  
Uniformity Condition ◽  
Membrane Division

P systems with active membranes have the ability of solving computationally hard problems. In this paper, the authors prove that uniform families of P systems with active membranes operating in polynomial time can solve the whole class of PP decision problems, without using nonelementary membrane division or dissolution rules. This result also holds for families having a stricter uniformity condition than the usual one.

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.

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
Sign in / Sign up

Export Citation Format

Share Document