A look at the descriptional complexity of \(\mathrm{SNQ}\) \(\mathrm{P}\) systems (Q1709916)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A look at the descriptional complexity of \(\mathrm{SNQ}\) \(\mathrm{P}\) systems |
scientific article; zbMATH DE number 7002235
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A look at the descriptional complexity of \(\mathrm{SNQ}\) \(\mathrm{P}\) systems |
scientific article; zbMATH DE number 7002235 |
Statements
A look at the descriptional complexity of \(\mathrm{SNQ}\) \(\mathrm{P}\) systems (English)
0 references
15 January 2019
0 references
\(\mathrm{P}\) systems
0 references
universality
0 references
descriptional complexity
0 references
register machines
0 references
spiking neural networks
0 references
