A New Characterization of NP, P, and PSPACE with Accepting Hybrid Networks of Evolutionary Processors

Authors:
Florin Manea;Maurice Margenstern;Victor Mitrana;Mario J. Pérez-Jiménez
Affiliations:
University of Bucharest, Faculty of Mathematics and Computer Science, Str. Academiei 14, 010014, Bucharest, Romania;University of Metz, LITA, UFR MIM, Ile du Saulcy, 57045, Metz-Cedex, France;University of Bucharest, Faculty of Mathematics and Computer Science, Str. Academiei 14, 010014, Bucharest, Romania and University Rovira i Virgili, Research Group in Mathematical Linguistics, Pca ...;University of Seville, Department of Computer Science and Artificial Intelligence, Seville, Spain
Venue:
Theory of Computing Systems
Year:
2010

Citing 0
Cited 5

The role of evolutionary operations in accepting hybrid networks of evolutionary processors

Information and Computation
Deciding networks of evolutionary processors

DLT'11 Proceedings of the 15th international conference on Developments in language theory
Deciding according to the shortest computations

CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Complexity results for deciding Networks of Evolutionary Processors

Theoretical Computer Science
Networks of polarized evolutionary processors

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider three complexity classes defined on Accepting Hybrid Networks of Evolutionary Processors (AHNEP) and compare them with the classical complexity classes defined on the standard computing model of Turing machine. By definition, AHNEPs are deterministic. We prove that the classical complexity class NP equals the family of languages decided by AHNEPs in polynomial time. A language is in P if and only if it is decided by an AHNEP in polynomial time and space. We also show that PSPACE equals the family of languages decided by AHNEPs in polynomial length.