Slightly Beyond Turing’s Computability for Studying Genetic Programming

DOI10.1007/978-3-540-74593-8_24MaRDI QIDQ3608490zbMATH OpenOpenAlexFDO

Authors Olivier Teytaud

Publication date 5 March 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74593-8_24

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Nonnumerical algorithms (68W05) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• scientific article; zbMATH DE number 1700043
• Mapping Non-conventional Extensions of Genetic Programming
• Mapping non-conventional extensions of genetic programming
• Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
• scientific article; zbMATH DE number 1668689

Cited in

(6)

• Computable model discovery and high-level-programming approximations to algorithmic complexity
• scientific article; zbMATH DE number 1700043 (Why is no real title available?)
• Genetic Programming for Inductive Inference of Chaotic Series
• scientific article; zbMATH DE number 1962049 (Why is no real title available?)
• Mapping Non-conventional Extensions of Genetic Programming
• Mapping non-conventional extensions of genetic programming

This page was built for publication: Slightly Beyond Turing’s Computability for Studying Genetic Programming

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