Universality for Turing Machines, Inductive Turing Machines and Evolutionary Algorithms

DOI10.3233/FI-2009-0033MaRDI QIDQ3632010zbMATH OpenOpenAlexFDO

Authors Eugene Eberbach, Mark Burgin

Publication date 23 June 2009

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2009-0033

zbMATH Keywords

evolutionary algorithmsevolutionary Turing machineinductive computationmodelingsuper-recursive algorithmsTuring machineuniversality

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• scientific article; zbMATH DE number 6949725
• Recursively Generated Evolutionary Turing Machines and Evolutionary Automata
• scientific article; zbMATH DE number 1223611
• Some considerations on universality
• scientific article; zbMATH DE number 1746026

Cited in

(5)

• A mathematical model for evolutionary systems
• Recursively Generated Evolutionary Turing Machines and Evolutionary Automata
• scientific article; zbMATH DE number 1746026 (Why is no real title available?)
• scientific article; zbMATH DE number 4114578 (Why is no real title available?)
• Observation of Unbounded Novelty in Evolutionary Algorithms is Unknowable

This page was built for publication: Universality for Turing Machines, Inductive Turing Machines and Evolutionary Algorithms

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