A look at the descriptional complexity of SNQ P systems (Q1709916)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7002235
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A look at the descriptional complexity of SNQ 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
0.8668725490570068
0 references
0.8550298810005188
0 references
0.8315386176109314
0 references
0.8171514868736267
0 references
0.8170931339263916
0 references
