Small universal accepting hybrid networks of evolutionary processors
From MaRDI portal
Publication:968278
DOI10.1007/s00236-009-0113-8zbMath1211.68016MaRDI QIDQ968278
Remco Loos, Victor Mitrana, Florin Manea
Publication date: 5 May 2010
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-009-0113-8
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
Related Items
On the computational power of networks of polarized evolutionary processors, Complexity results for deciding networks of evolutionary processors, Computational completeness of complete, star-like, and linear hybrid networks of evolutionary processors with a small number of processors, Polarization: a new communication protocol in networks of bio-inspired processors
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Small universal Turing machines
- On the size of computationally complete hybrid networks of evolutionary processors
- All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size
- About Universal Hybrid Networks of Evolutionary Processors of Small Size
- On the Computational Complexity of Algorithms
- DNA Computing
- On the size complexity of universal accepting hybrid networks of evolutionary processors
- Formal Reductions of the General Combinatorial Decision Problem
