All NP-problems can be solved in polynomial time by accepting networks of splicing processors of constant size

Authors:
Florin Manea;Carlos Martín-Vide;Victor Mitrana
Affiliations:
Faculty of Mathematics and Computer Science, University of Bucharest, Bucharest, Romania;Research Group in Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain;Faculty of Mathematics and Computer Science, University of Bucharest, Bucharest, Romania
Venue:
DNA'06 Proceedings of the 12th international conference on DNA Computing
Year:
2006

Citing 5
Cited 5

The connection machine

The connection machine
Towards a new architecture for symbolic processing

AIICSR'94 Proceedings of the sixth international conference on Artificial intelligence and information-control systems of robots
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)

DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
Accepting networks of splicing processors: Complexity results

Theoretical Computer Science

Networks of evolutionary processors: UML architecture

CIMMACS'06 Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics
On Accepting Networks of Splicing Processors of Size 3

CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
On small, reduced, and fast universal accepting networks of splicing processors

Theoretical Computer Science
jNEPView: A Graphical Trace Viewer for the Simulations of NEPs

IWINAC '09 Proceedings of the 3rd International Work-Conference on The Interplay Between Natural and Artificial Computation: Part I: Methods and Models in Artificial and Natural Computation. A Homage to Professor Mira's Scientific Legacy
Accepting networks of splicing processors with filtered connections

MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality

Quantified Score

Hi-index	0.02

Visualization

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.