Hybrid networks of evolutionary processors are computationally complete

DOI10.1007/S00236-004-0158-7MaRDI QIDQ1772104zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• On the size of computationally complete hybrid networks of evolutionary processors
• Five nodes are sufficient for hybrid networks of evolutionary processors to be computationally complete
• Computational completeness of complete, star-like, and linear hybrid networks of evolutionary processors with a small number of processors
• About Universal Hybrid Networks of Evolutionary Processors of Small Size
• About precise characterization of languages generated by hybrid networks of evolutionary processors with one node

Cites work

• scientific article; zbMATH DE number 1728707 (Why is no real title available?)
• scientific article; zbMATH DE number 2013489 (Why is no real title available?)
• Characterizations of recursively enumerable languages by means of insertion grammars
• Contextual insertions/deletions and computability
• Evolutionary systems: A language generating device inspired by evolving communities of cells
• Networks of evolutionary processors
• Normal forms for phrase-structure grammars

Cited in

(16)

• All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size
• scientific article; zbMATH DE number 1728707 (Why is no real title available?)
• Computational completeness of complete, star-like, and linear hybrid networks of evolutionary processors with a small number of processors
• Accepting Networks of Non-inserting Evolutionary Processors
• scientific article; zbMATH DE number 2013489 (Why is no real title available?)
• Networks of reaction systems
• On the number of nodes in universal networks of evolutionary processors
• About Universal Hybrid Networks of Evolutionary Processors of Small Size
• About precise characterization of languages generated by hybrid networks of evolutionary processors with one node
• Biocomputing: an insight from linguistics
• Accepting networks of genetic processors are computationally complete
• On the size of computationally complete hybrid networks of evolutionary processors
• A new characterization of NP, P, and PSPACE with accepting hybrid networks of evolutionary processors
• Accepting networks of splicing processors: complexity results
• (Tissue) P systems with vesicles of multisets
• Five nodes are sufficient for hybrid networks of evolutionary processors to be computationally complete

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1772104)