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

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. Martín-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.