ON THE DESCRIPTIONAL COMPLEXITY OF ACCEPTING NETWORKS OF EVOLUTIONARY PROCESSORS WITH FILTERED CONNECTIONS (Q3542873)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | ON THE DESCRIPTIONAL COMPLEXITY OF ACCEPTING NETWORKS OF EVOLUTIONARY PROCESSORS WITH FILTERED CONNECTIONS |
scientific article |
Statements
ON THE DESCRIPTIONAL COMPLEXITY OF ACCEPTING NETWORKS OF EVOLUTIONARY PROCESSORS WITH FILTERED CONNECTIONS (English)
0 references
1 December 2008
0 references
Turing machine
0 references
universality
0 references
complexity class
0 references
network of evolutionary processors
0 references