Published January 17, 2017 | Version v1
Publication Metadata-only

Accepting Hybrid Networks of Evolutionary Processors

Margenstern, Maurice
Mitrana, Víctor
Pérez Jiménez, Mario de Jesús
Other:
Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial

Description

We consider time complexity classes defined on accepting hybrid networks of evolutionary processors (AHNEP) similarly to the classical time 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 set of languages accepted by AHNEPs in polynomial time.

Additional details

Identifiers Origin repository
Created:
December 4, 2022
Modified:
November 28, 2023