Accepting networks of genetic processors are computationally complete

DOI10.1016/J.TCS.2012.06.028zbMath1309.68067OpenAlexW1999436197MaRDI QIDQ714860

Marcelino Campos, Jose M. Sempere

Publication date: 11 October 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.06.028

zbMATH Keywords

computational completenessparallel genetic algorithmsnetworks of biologically-inspired processors

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Filters defined by random contexts versus polarization in networks of evolutionary processors ⋮ Networks of splicing processors with evaluation sets as optimization problems solvers ⋮ Polarization: a new communication protocol in networks of bio-inspired processors

Uses Software

• Genocop

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The role of evolutionary operations in accepting hybrid networks of evolutionary processors
• Accepting networks of splicing processors: complexity results
• Accepting splicing systems
• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• Networks of evolutionary processors
• Membrane computing. An introduction.
• All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size
• On the Power of Networks of Evolutionary Processors
• On Accepting Networks of Evolutionary Processors with at Most Two Types of Nodes
• DNA Computing
• A Machine-Independent Theory of the Complexity of Recursive Functions
• New Computational Paradigms

This page was built for publication: Accepting networks of genetic processors are computationally complete