scholarly journals Remarks on the Computational Power of Some Restricted Variants of P Systems with Active Membranes

2017 ◽  
pp. 209-232 ◽  
Author(s):  
Zsolt Gazdag ◽  
Gábor Kolonits
Keyword(s):  
P Systems ◽  
Computational Power ◽  
Active Membranes

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.

The computational power of monodirectional tissue P systems with symport rules

2021 ◽  
pp. 104751
Author(s):  
Bosheng Song ◽  
Shengye Huang ◽  
Xiangxiang Zeng
Keyword(s):  
P Systems ◽  
Computational Power

Computational power of sequential spiking neural P systems with multiple channels

2021 ◽  
Author(s):  
Zeqiong Lv ◽  
Qian Yang ◽  
Hong Peng ◽  
Xiaoxiao Song ◽  
Jun Wang
Keyword(s):  
P Systems ◽  
Multiple Channels ◽  
Computational Power ◽  
Spiking Neural P Systems

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

ON THE POWER OF FAMILIES OF RECOGNIZER SPIKING NEURAL P SYSTEMS

2011 ◽  
Vol 22 (01) ◽  
pp. 75-88
Author(s):  
PETR SOSÍK ◽  
ALFONSO RODRÍGUEZ-PATÓN ◽  
LUDĚK CIENCIALA
Keyword(s):  
P Systems ◽  
Complexity Classes ◽  
Computational Power ◽  
Spiking Neural P Systems ◽  
Formal Framework

The paper summarizes recent knowledge about computational power of spiking neural P systems and presents a sequence of new more general results. The concepts of recognizer SN P systems and of uniform families of SN P systems provide a formal framework for this study. We establish the relation of computational power of spiking neural P systems with various limitations to standard complexity classes like P , NP, PSPACE and P /poly.

Sign in / Sign up

Export Citation Format

Share Document