Abstract
In this paper, we present two new results regarding ANSPs. The first one states that every recursively enumerable language can be accepted by an ANSP of size 7 out of which 6 do not depend on the given language. Then we propose a method for constructing, given an NP-language, an ANSP of size 7 accepting that language in polynomial time. Unlike the previous case, all nodes of this ANSP depend on the given language. Since each ANSP may be viewed as a problem solver as shown in [6], the later result may be interpreted as a method for solving every NP-problem in polynomial time by an ANSP of size 7.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Csuhaj-Varjú, E., Kari, L., Păun, G.: Test tube distributed systems based on splicing. Computers and AI 15, 211–232 (1996)
Errico, L., Jesshope, C.: Towards a new architecture for symbolic processing. In: Artificial Intelligence and Information-Control Systems of Robots 1994, pp. 31–40. World Scientific Publishing, Singapore (1994)
Fahlman, S.E., Hinton, G.E., Seijnowski, T.J.: Massively parallel architectures for AI: NETL, THISTLE and Boltzmann machines. In: Proc. AAAI National Conf. on AI, pp. 109–113. William Kaufman, Los Altos (1983)
Garey, M., Johnson, D.: Computers and Intractability. A Guide to the Theory of NP-completeness. Freeman, New York (1979)
Hillis, W.D.: The Connection Machine. MIT Press, Cambridge (1985)
Manea, F., Martín-Vide, C., Mitrana, V.: Accepting networks of splicing processors: complexity results. Theoretical Computer Science (to appear)
Martín-Vide, C., Mitrana, V.: Networks of evolutionary processors: results and perspectives. In: Molecular Computational Models: Unconventional Approaches, pp. 78–114. Idea Group Publishing, Hershey (2005)
Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing. New Computing Paradigms. Springer, Berlin (1998)
Păun, G.: Distributed architectures in DNA computing based on splicing: Limiting the size of components. In: Unconventional Models of Computation, pp. 323–335. Springer, Berlin (1998)
Sankoff, D., et al.: Gene order comparisons for phylogenetic inference:Evolution of the mitochondrial genome. Proc. Natl. Acad. Sci. USA 89, 6575–6579 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Manea, F., Martín-Vide, C., Mitrana, V. (2006). All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size. In: Mao, C., Yokomori, T. (eds) DNA Computing. DNA 2006. Lecture Notes in Computer Science, vol 4287. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11925903_4
Download citation
DOI: https://doi.org/10.1007/11925903_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49024-1
Online ISBN: 978-3-540-68423-7
eBook Packages: Computer ScienceComputer Science (R0)