Recursively Generated Evolutionary Turing Machines and Evolutionary Automata

DOI10.1007/978-3-642-29694-9_9zbMath1277.68226OpenAlexW2267331800MaRDI QIDQ2866110

Eugene Eberbach, Mark S. Burgin

Publication date: 13 December 2013

Published in: Studies in Computational Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29694-9_9

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) General topics in artificial intelligence (68T01)

Cites Work

• Real functions and numbers defined by Turing machines
• Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines
• A study of drift analysis for estimating computation time of evolutionary algorithms
• Super-Recursive Algorithms
• Universality for Turing Machines, Inductive Turing Machines and Evolutionary Algorithms
• Neural networks and adaptive expert systems in the CSA approach
• Nonlinear phenomena in spaces of algorithms
• Fuzzy Algorithms: With Applications to Image Processing and Pattern Recognition
• Fuzzy algorithms
• Recursive Real Numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Recursively Generated Evolutionary Turing Machines and Evolutionary Automata