|
Descripción
|
|
|---|---|
| We study the computational potential of spiking neural (SN) P systems. several intractable problems have been proven to be solvable by these systems in polynomial or even constant time. We study first their formal aspects such as the input encoding, halting versus spiking, and descriptional complexity. Then we establish a formal platform for complexity classes of uniform families of confluent recognizer SN P sys- tems. Finally, we present results characterizing the computational power of several variants of confluent SN P systems, characterized by classes ranging from P to PSPACE. | |
|
Internacional
|
Si |
|
JCR del ISI
|
No |
|
Título de la revista
|
Lecture notes in computer science |
|
ISSN
|
0302-9743 |
|
Factor de impacto JCR
|
0 |
|
Información de impacto
|
|
|
Volumen
|
|
|
DOI
|
|
|
Número de revista
|
|
|
Desde la página
|
348 |
|
Hasta la página
|
360 |
|
Mes
|
ENERO |
|
Ranking
|
|