Manea, FlorinMargenstern, MauriceMitrana, VíctorPérez Jiménez, Mario de Jesús2018-01-182018-01-182010Manea, F., Margenstern, M., Mitrana, V. y Pérez Jiménez, M.d.J. (2010). A New Characterization of NP, P, and PSPACE with Accepting Hybrid Networks of Evolutionary Processors. Theory of Computing Systems, 46 (2), 174-192.1432-4350https://hdl.handle.net/11441/69142We 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.application/pdfengAttribution-NonCommercial-NoDerivatives 4.0 Internacionalhttp://creativecommons.org/licenses/by-nc-nd/4.0/Evolution strategiesEvolutionary processorNetwork of evolutionary processorsTuring machineComputational complexity classesinfo:eu-repo/semantics/articleinfo:eu-repo/semantics/openAccesshttps://doi.org/10.1007/s00224-008-9124-z