Accepting networks of genetic processors are computationally complete

DOI10.1016/J.TCS.2012.06.028MaRDI QIDQ714860zbMATH OpenOpenAlexFDO

Authors M. 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

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) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Hybrid networks of evolutionary processors are computationally complete
• Accepting networks of evolutionary word and picture processors: a survey
• A universal accepting hybrid network of evolutionary processors
• Accepting networks of evolutionary processors with subregular filters
• Networks of evolutionary processors: computationally complete normal forms

Cites work

• scientific article; zbMATH DE number 1728707 (Why is no real title available?)
• scientific article; zbMATH DE number 1236223 (Why is no real title available?)
• scientific article; zbMATH DE number 1550514 (Why is no real title available?)
• scientific article; zbMATH DE number 867338 (Why is no real title available?)
• scientific article; zbMATH DE number 1418967 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Accepting networks of splicing processors: complexity results
• Accepting splicing systems
• All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size
• DNA Computing
• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• Membrane computing. An introduction.
• Networks of evolutionary processors
• New Computational Paradigms
• On Accepting Networks of Evolutionary Processors with at Most Two Types of Nodes
• On the Power of Networks of Evolutionary Processors
• The role of evolutionary operations in accepting hybrid networks of evolutionary processors

Cited in

(3)

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

Describes a project that uses

Uses Software

• Genocop

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714860)