On small, reduced, and fast universal accepting networks of splicing processors

DOI10.1016/j.tcs.2008.09.048zbMath1160.68014OpenAlexW2001035485MaRDI QIDQ1004084

Remco Loos, Victor Mitrana, Florin Manea

Publication date: 2 March 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.09.048

zbMATH Keywords

splicingmolecular computationnetworks of processors

Mathematics Subject Classification ID

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

Related Items (6)

Networks of Polarized Splicing Processors ⋮ Universality in Molecular and Cellular Computing ⋮ Networks of splicing processors: simulations between topologies ⋮ Small networks of polarized splicing processors are universal ⋮ Networks of splicing processors with evaluation sets as optimization problems solvers ⋮ Polarization: a new communication protocol in networks of bio-inspired processors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Accepting networks of splicing processors: complexity results
• All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size
• Small fast universal Turing machines
• TIME-VARYING DISTRIBUTED H SYSTEMS OF DEGREE 1 GENERATE ALL RECURSIVELY ENUMERABLE LANGUAGES
• On the Computational Complexity of Algorithms
• All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size
• DNA Computing
• On the size complexity of universal accepting hybrid networks of evolutionary processors

This page was built for publication: On small, reduced, and fast universal accepting networks of splicing processors