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

Authors:
Florin Manea;Victor Mitrana
Affiliations:
Faculty of Mathematics and Computer Science, University of Bucharest, Str. Academiei 14, 70109 Bucharest, Romania;Faculty of Mathematics and Computer Science, University of Bucharest, Str. Academiei 14, 70109 Bucharest, Romania and Research Group in Mathematical Linguistics, Rovira i Virgili University, Pl. I ...
Venue:
Information Processing Letters
Year:
2007

Citing 9
Cited 6

Towards a new architecture for symbolic processing

AIICSR'94 Proceedings of the sixth international conference on Artificial intelligence and information-control systems of robots
Handbook of formal languages, vol. 3: beyond words

Handbook of formal languages, vol. 3: beyond words
Networks of Parallel Language Processors

New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)
Introduction to Evolutionary Computing

Introduction to Evolutionary Computing
Hybrid networks of evolutionary processors are computationally complete

Acta Informatica
Accepting networks of splicing processors: Complexity results

Theoretical Computer Science
On the size complexity of universal accepting hybrid networks of evolutionary processors

Mathematical Structures in Computer Science
Solving 3CNF-SAT and HPP in linear time using WWW

MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Accepting hybrid networks of evolutionary processors

DNA'04 Proceedings of the 10th international conference on DNA computing

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

Theoretical Computer Science
On Accepting Networks of Evolutionary Processors with at Most Two Types of Nodes

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
On the size of computationally complete hybrid networks of evolutionary processors

Theoretical Computer Science
PNEPs, NEPs for Context Free Parsing: Application to Natural Language Processing

IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
The role of evolutionary operations in accepting hybrid networks of evolutionary processors

Information and Computation
Accepting Networks of Genetic Processors are computationally complete

Theoretical Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper, we present a new result regarding Accepting Hybrid Networks of Evolutionary Processors (AHNEP for short): we propose a method for constructing, for every NP-language, an AHNEP of size 24 deciding that language in polynomial time. While the number of nodes of this AHNEP does not depend on the language, the other parameters of the network (rules, symbols, filters) depend on it. Since each AHNEP may be viewed as a problem solver as shown in [C. Martin-Vide, V. Mitrana, Networks of evolutionary processors: results and perspectives, in: Molecular Computational Models: Unconventional Approaches, Idea Group Publishing, Hershey, 2005, pp. 78-114], the later result may be interpreted as a method for solving every NP-problem in polynomial time by AHNEPs of constant size.