A new characterization of NP, P, and PSPACE with accepting hybrid networks of evolutionary processors
DOI10.1007/S00224-008-9124-ZzbMATH Open1209.68264OpenAlexW1981914472MaRDI QIDQ970101FDOQ970101
Mario J. Pérez-Jiménez, Victor Mitrana, M. Margenstern, Florin Manea
Publication date: 10 May 2010
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://idus.us.es/handle//11441/69142
evolution strategiesTuring machinenetwork of evolutionary processorscomputational complexity classesevolutionary processor
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cites Work
- Networks of evolutionary processors
- Evolutionary systems: A language generating device inspired by evolving communities of cells
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Computational Complexity of Algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the size complexity of hybrid networks of evolutionary processors
- Hybrid networks of evolutionary processors are computationally complete
- Machines, Computations, and Universality
Cited In (14)
- Complexity results for deciding networks of evolutionary processors
- Accepting networks of evolutionary processors with subregular filters
- Polarization: a new communication protocol in networks of bio-inspired processors
- Filters defined by random contexts versus polarization in networks of evolutionary processors
- FILTER POSITION IN NETWORKS OF SUBSTITUTION PROCESSORS DOES NOT MATTER
- Simulating polarization by random context filters in networks of evolutionary processors
- The role of evolutionary operations in accepting hybrid networks of evolutionary processors
- P systems with proteins on membranes characterize PSPACE
- Networks of polarized evolutionary processors
- Networks of splicing processors with evaluation sets as optimization problems solvers
- Accepting Networks of Non-inserting Evolutionary Processors
- Deciding According to the Shortest Computations
- On the computational power of networks of polarized evolutionary processors
- A Linear Time Solution for N-Queens Problem Using Generalized Networks of Evolutionary Polarized Processors
Recommendations
- On the size complexity of universal accepting hybrid networks of evolutionary processors 👍 👎
- A survey on computationally complete accepting and generating networks of evolutionary processors 👍 👎
- On the size complexity of hybrid networks of evolutionary processors 👍 👎
- ON THE DESCRIPTIONAL COMPLEXITY OF ACCEPTING NETWORKS OF EVOLUTIONARY PROCESSORS WITH FILTERED CONNECTIONS 👍 👎
- On the size of computationally complete hybrid networks of evolutionary processors 👍 👎
- Title not available (Why is that?) 👍 👎
- On Accepting Networks of Evolutionary Processors with at Most Two Types of Nodes 👍 👎
- On the power of accepting networks of evolutionary processors with special topologies and random context filters 👍 👎
- Complexity results for deciding networks of evolutionary processors 👍 👎
- The role of evolutionary operations in accepting hybrid networks of evolutionary processors 👍 👎
This page was built for publication: A new characterization of NP, P, and PSPACE with accepting hybrid networks of evolutionary processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q970101)
