Reflective inductive inference of recursive functions

DOI10.1016/j.tcs.2008.02.022zbMath1145.68023OpenAlexW2118038654MaRDI QIDQ924166

Gunter Grieser

Publication date: 28 May 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.02.022

zbMATH Keywords

reflectionlearning theoryinductive inferencelearning in the limitself-assessment

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Related Items

Learning recursive functions: A survey, Confident and consistent partial learning of recursive functions, On some open problems in reflective inductive inference

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Towards a mathematical theory of machine discovery from facts
• One-sided error probabilistic inductive inference and reliable frequency identification
• Some natural properties of strong-identification in inductive inference
• Learning with refutation
• Refutable language learning with a neighbor system.
• On learning of functions refutably.
• Refuting learning revisited.
• Toward a mathematical theory of inductive inference
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Language identification in the limit