On small, reduced, and fast universal accepting networks of splicing processors
DOI10.1016/J.TCS.2008.09.048zbMATH Open1160.68014OpenAlexW2001035485MaRDI QIDQ1004084FDOQ1004084
Authors: Remco Loos, Florin Manea, Victor Mitrana 
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
Recommendations
- On Accepting Networks of Splicing Processors of Size 3
- All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size
- New Computational Paradigms
- Accepting Networks of Splicing Processors with Filtered Connections
- Networks of Polarized Splicing Processors
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cites Work
- On the Computational Complexity of Algorithms
- DNA Computing
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Small fast universal Turing machines
- On the size complexity of universal accepting hybrid networks of evolutionary processors
- All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size
- Title not available (Why is that?)
- Title not available (Why is that?)
- Accepting networks of splicing processors: complexity results
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- TIME-VARYING DISTRIBUTED H SYSTEMS OF DEGREE 1 GENERATE ALL RECURSIVELY ENUMERABLE LANGUAGES
- All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size
Cited In (12)
- Polarization: a new communication protocol in networks of bio-inspired processors
- New Computational Paradigms
- All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size
- Accepting networks of splicing processors: complexity results
- Networks of Polarized Splicing Processors
- On Accepting Networks of Splicing Processors of Size 3
- 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
- Universality in Molecular and Cellular Computing
- ON SMALL UNIVERSAL SPLICING SYSTEMS
- Accepting Networks of Splicing Processors with Filtered Connections
This page was built for publication: On small, reduced, and fast universal accepting networks of splicing processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1004084)
