Universality for Turing Machines, Inductive Turing Machines and Evolutionary Algorithms

DOI10.3233/FI-2009-0033zbMath1191.68300OpenAlexW1512266229MaRDI QIDQ3632010

Eugene Eberbach, Mark S. 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

modelinguniversalityTuring machineevolutionary algorithmssuper-recursive algorithmsevolutionary Turing machineinductive computation

Mathematics Subject Classification ID

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

Related Items (1)

Recursively Generated Evolutionary Turing Machines and Evolutionary Automata

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