Computational power of cell separation in tissue P systems

2014 ◽  
Vol 279 ◽  
pp. 805-815 ◽  
Author(s):  
Petr Sosík ◽  
Luděk Cienciala
2021 ◽  
pp. 104751
Author(s):  
Bosheng Song ◽  
Shengye Huang ◽  
Xiangxiang Zeng

Author(s):  
Luis F. Macías-Ramos ◽  
Mario J. Pérez-Jiménez ◽  
Agustín Riscos-Núñez ◽  
Miquel Rius-Font ◽  
Luis Valencia-Cabrera
Keyword(s):  

2011 ◽  
Vol 22 (01) ◽  
pp. 75-88
Author(s):  
PETR SOSÍK ◽  
ALFONSO RODRÍGUEZ-PATÓN ◽  
LUDĚK CIENCIALA

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.


Author(s):  
Tingfang Wu ◽  
Qiang Lyu ◽  
Linqiang Pan

Spiking neural P systems (SNP systems) are a class of distributed and parallel computation models, which are inspired by the way in which neurons process information through spikes, where the integrate-and-fire behavior of neurons and the distribution of produced spikes are achieved by spiking rules. In this work, a novel mechanism for separately describing the integrate-and-fire behavior of neurons and the distribution of produced spikes, and a novel variant of the SNP systems, named evolution-communication SNP (ECSNP) systems, is proposed. More precisely, the integrate-and-fire behavior of neurons is achieved by spike-evolution rules, and the distribution of produced spikes is achieved by spike-communication rules. Then, the computational power of ECSNP systems is examined. It is demonstrated that ECSNP systems are Turing universal as number-generating devices. Furthermore, the computational power of ECSNP systems with a restricted form, i.e. the quantity of spikes in each neuron throughout a computation does not exceed some constant, is also investigated, and it is shown that such restricted ECSNP systems can only characterize the family of semilinear number sets. These results manifest that the capacity of neurons for information storage (i.e. the quantity of spikes) has a critical impact on the ECSNP systems to achieve a desired computational power.


2020 ◽  
Vol 30 (10) ◽  
pp. 2050008 ◽  
Author(s):  
Hong Peng ◽  
Zeqiong Lv ◽  
Bo Li ◽  
Xiaohui Luo ◽  
Jun Wang ◽  
...  

This paper proposes a new variant of spiking neural P systems (in short, SNP systems), nonlinear spiking neural P systems (in short, NSNP systems). In NSNP systems, the state of each neuron is denoted by a real number, and a real configuration vector is used to characterize the state of the whole system. A new type of spiking rules, nonlinear spiking rules, is introduced to handle the neuron’s firing, where the consumed and generated amounts of spikes are often expressed by the nonlinear functions of the state of the neuron. NSNP systems are a class of distributed parallel and nondeterministic computing systems. The computational power of NSNP systems is discussed. Specifically, it is proved that NSNP systems as number-generating/accepting devices are Turing-universal. Moreover, we establish two small universal NSNP systems for function computing and number generator, containing 117 neurons and 164 neurons, respectively.


Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-21 ◽  
Author(s):  
Linqiang Pan ◽  
Bosheng Song ◽  
Luis Valencia-Cabrera ◽  
Mario J. Pérez-Jiménez

Tissue P systems with evolutional communication (symport/antiport) rules are computational models inspired by biochemical systems consisting of multiple individuals living and cooperating in a certain environment, where objects can be modified when moving from one region to another region. In this work, cell separation, inspired from membrane fission process, is introduced in the framework of tissue P systems with evolutional communication rules. The computational complexity of this kind of P systems is investigated. It is proved that only problems in class P can be efficiently solved by tissue P systems with cell separation with evolutional communication rules of length at most (n,1), for each natural number n≥1. In the case where that length is upper bounded by (3,2), a polynomial time solution to the SAT problem is provided, hence, assuming that P≠NP a new boundary between tractability and NP-hardness on the basis of the length of evolutional communication rules is provided. Finally, a new simulator for tissue P systems with evolutional communication rules is designed and is used to check the correctness of the solution to the SAT problem.


2005 ◽  
Vol 16 (04) ◽  
pp. 663-682 ◽  
Author(s):  
RUDOLF FREUND

Based on a quite general definition of P systems where the rules are applied in a sequential way (and not in the maximally parallel way as it usually happens in most models of P systems considered so far in the literature), we investigate the generative power of various models of such P systems working in the sequential mode on arrays and strings, respectively. P systems working in the sequential mode on arrays/strings without priority relations for the rules reveal the same computational power as the corresponding matrix grammars without appearance checking working on arrays/strings. For obtaining the computational power of matrix grammars with appearance checking, priority relations for the rules (as one of many other possible additional features) are needed.


Sign in / Sign up

Export Citation Format

Share Document