Hybrid networks of evolutionary processors are computationally complete

DOI10.1007/s00236-004-0158-7zbMath1067.68014OpenAlexW1963741156MaRDI QIDQ1772104

Victor Mitrana, Erzsébet Csuhaj-Varjú, Carlos Martín-Vide

Publication date: 15 April 2005

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-004-0158-7

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computer system organization (68M99)

Related Items

All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size ⋮ On the number of nodes in universal networks of evolutionary processors ⋮ Accepting networks of splicing processors: complexity results ⋮ Unnamed Item ⋮ About Universal Hybrid Networks of Evolutionary Processors of Small Size ⋮ Computational completeness of complete, star-like, and linear hybrid networks of evolutionary processors with a small number of processors ⋮ Biocomputing: an insight from linguistics ⋮ A new characterization of NP, P, and PSPACE with accepting hybrid networks of evolutionary processors ⋮ On the size of computationally complete hybrid networks of evolutionary processors ⋮ Networks of Reaction Systems ⋮ Accepting Networks of Non-inserting Evolutionary Processors

Cites Work

• Contextual insertions/deletions and computability
• Characterizations of recursively enumerable languages by means of insertion grammars
• Networks of evolutionary processors
• Evolutionary systems: A language generating device inspired by evolving communities of cells
• Normal forms for phrase-structure grammars
• Unnamed Item
• Unnamed Item

This page was built for publication: Hybrid networks of evolutionary processors are computationally complete