ON THE DESCRIPTIONAL COMPLEXITY OF ACCEPTING NETWORKS OF EVOLUTIONARY PROCESSORS WITH FILTERED CONNECTIONS (Q3542873): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: On the size complexity of universal accepting hybrid networks of evolutionary processors / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4298260 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1142/s0129054108006170 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2030688505 / rank | |||
Normal rank | |||
Latest revision as of 10:52, 30 July 2024
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
