Computational completeness of sequential spiking neural P systems with inhibitory rules

2021 ◽  
pp. 104786
Author(s):  
Tingting Bao ◽  
Nan Zhou ◽  
Hong Peng ◽  
Qian Yang ◽  
Jun Wang
Author(s):  
Artiom Alhazov ◽  
Rudolf Freund ◽  
Sergiu Ivanov

AbstractCatalytic P systems are among the first variants of membrane systems ever considered in this area. This variant of systems also features some prominent computational complexity questions, and in particular the problem of using only one catalyst in the whole system: is one catalyst enough to allow for generating all recursively enumerable sets of multisets? Several additional ingredients have been shown to be sufficient for obtaining computational completeness even with only one catalyst. In this paper, we show that one catalyst is sufficient for obtaining computational completeness if either catalytic rules have weak priority over non-catalytic rules or else instead of the standard maximally parallel derivation mode, we use the derivation mode maxobjects, i.e., we only take those multisets of rules which affect the maximal number of objects in the underlying configuration.


2021 ◽  
Vol 138 ◽  
pp. 126-139
Author(s):  
Luis Garcia ◽  
Giovanny Sanchez ◽  
Eduardo Vazquez ◽  
Gerardo Avalos ◽  
Esteban Anides ◽  
...  

Processes ◽  
2021 ◽  
Vol 9 (3) ◽  
pp. 549
Author(s):  
Xiu Yin ◽  
Xiyu Liu ◽  
Minghe Sun ◽  
Qianqian Ren

A novel variant of NSN P systems, called numerical spiking neural P systems with a variable consumption strategy (NSNVC P systems), is proposed. Like the spiking rules consuming spikes in spiking neural P systems, NSNVC P systems introduce a variable consumption strategy by modifying the form of the production functions used in NSN P systems. Similar to the delay feature of the spiking rules, NSNVC P systems introduce a postponement feature into the production functions. The execution of the production functions in NSNVC P systems is controlled by two, i.e., polarization and threshold, conditions. Multiple synaptic channels are used to transmit the charges and the production values in NSNVC P systems. The proposed NSNVC P systems are a type of distributed parallel computing models with a directed graphical structure. The Turing universality of the proposed NSNVC P systems is proved as number generating/accepting devices. Detailed descriptions are provided for NSNVC P systems as number generating/accepting devices. In addition, a universal NSNVC P system with 66 neurons is constructed as a function computing device.


2018 ◽  
Vol 50 (2) ◽  
pp. 1485-1502 ◽  
Author(s):  
Tao Song ◽  
Shanchen Pang ◽  
Shaohua Hao ◽  
Alfonso Rodríguez-Patón ◽  
Pan Zheng

2010 ◽  
Vol 7 (5) ◽  
pp. 890-899 ◽  
Author(s):  
Xingyi Zhang ◽  
Yun Jiang ◽  
Linqiang Pan

2015 ◽  
Vol 151 ◽  
pp. 1439-1445 ◽  
Author(s):  
Tao Song ◽  
Quan Zou ◽  
Xiangrong Liu ◽  
Xiangxiang Zeng

Sign in / Sign up

Export Citation Format

Share Document