On the size of computationally complete hybrid networks of evolutionary processors
From MaRDI portal
Publication:2271455
DOI10.1016/J.TCS.2009.05.003zbMath1173.68019OpenAlexW1968727765MaRDI QIDQ2271455
Yurii Rogozhin, Artiom Alhazov, Erzsébet Csuhaj-Varjú, Carlos Martín-Vide
Publication date: 7 August 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.05.003
Related Items (7)
Computational completeness of complete, star-like, and linear hybrid networks of evolutionary processors with a small number of processors ⋮ Complexity-preserving simulations among three variants of accepting networks of evolutionary processors ⋮ Small universal accepting hybrid networks of evolutionary processors ⋮ The role of evolutionary operations in accepting hybrid networks of evolutionary processors ⋮ Complexity results for deciding networks of evolutionary processors ⋮ Polarization: a new communication protocol in networks of bio-inspired processors ⋮ Networks of evolutionary processors: computationally complete normal forms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the number of nodes in universal networks of evolutionary processors
- Nine universal circular Post machines
- Decision problems for semi-Thue systems with a few rules
- On the size complexity of hybrid networks of evolutionary processors
- Hybrid networks of evolutionary processors are computationally complete
- 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 Power of Networks of Evolutionary Processors
- DNA Computing
- On the size complexity of universal accepting hybrid networks of evolutionary processors
- Small universal circular Post machines
This page was built for publication: On the size of computationally complete hybrid networks of evolutionary processors
