LAPSE:2023.24916
Published Article

LAPSE:2023.24916
Novel Numerical Spiking Neural P Systems with a Variable Consumption Strategy
March 28, 2023
Abstract
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.
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.
Record ID
Keywords
membrane computing, numerical spiking neural P systems, postponement features, Turing universality, variable consumption strategy
Suggested Citation
Yin X, Liu X, Sun M, Ren Q. Novel Numerical Spiking Neural P Systems with a Variable Consumption Strategy. (2023). LAPSE:2023.24916
Author Affiliations
Yin X: Academy of Management Science, Business School, Shandong Normal University, Jinan 250000, China
Liu X: Academy of Management Science, Business School, Shandong Normal University, Jinan 250000, China [ORCID]
Sun M: College of Business, The University of Texas at San Antonio, San Antonio, TX 78249, USA [ORCID]
Ren Q: Academy of Management Science, Business School, Shandong Normal University, Jinan 250000, China
Liu X: Academy of Management Science, Business School, Shandong Normal University, Jinan 250000, China [ORCID]
Sun M: College of Business, The University of Texas at San Antonio, San Antonio, TX 78249, USA [ORCID]
Ren Q: Academy of Management Science, Business School, Shandong Normal University, Jinan 250000, China
Journal Name
Processes
Volume
9
Issue
3
First Page
549
Year
2021
Publication Date
2021-03-20
ISSN
2227-9717
Version Comments
Original Submission
Other Meta
PII: pr9030549, Publication Type: Journal Article
Record Map
Published Article

LAPSE:2023.24916
This Record
External Link

https://doi.org/10.3390/pr9030549
Publisher Version
Download
Meta
Record Statistics
Record Views
260
Version History
[v1] (Original Submission)
Mar 28, 2023
Verified by curator on
Mar 28, 2023
This Version Number
v1
Citations
Most Recent
This Version
URL Here
https://psecommunity.org/LAPSE:2023.24916
Record Owner
Auto Uploader for LAPSE
Links to Related Works
(0.09 seconds)
[0.09 s]
