On the Power of Families of Recognizer Spiking Neural P systems
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F47813059%3A19240%2F11%3A%230003703" target="_blank" >RIV/47813059:19240/11:#0003703 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1142/S0129054111007848" target="_blank" >http://dx.doi.org/10.1142/S0129054111007848</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1142/S0129054111007848" target="_blank" >10.1142/S0129054111007848</a>
Alternative languages
Result language
angličtina
Original language name
On the Power of Families of Recognizer Spiking Neural P systems
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Foundations of Computer Science
ISSN
0129-0541
e-ISSN
—
Volume of the periodical
22
Issue of the periodical within the volume
1
Country of publishing house
SG - SINGAPORE
Number of pages
14
Pages from-to
75-88
UT code for WoS article
000286612200007
EID of the result in the Scopus database
—