ON THE DESCRIPTIONAL COMPLEXITY OF ACCEPTING NETWORKS OF EVOLUTIONARY PROCESSORS WITH FILTERED CONNECTIONS

DOI10.1142/S0129054108006170zbMath1175.68161OpenAlexW2030688505MaRDI QIDQ3542873

Cezara Dragoi, Florin Manea

Publication date: 1 December 2008

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054108006170

zbMATH Keywords

universalityTuring machinenetwork of evolutionary processorscomplexity class

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items

Complexity-preserving simulations among three variants of accepting networks of evolutionary processors

Cites Work

• All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size
• On the size complexity of universal accepting hybrid networks of evolutionary processors
• Unnamed Item

This page was built for publication: ON THE DESCRIPTIONAL COMPLEXITY OF ACCEPTING NETWORKS OF EVOLUTIONARY PROCESSORS WITH FILTERED CONNECTIONS