Inductive inference and computable numberings

DOI10.1016/j.tcs.2010.12.041zbMath1221.03035OpenAlexW1991150329MaRDI QIDQ2430009

S. A. Badaev, Ambos-Spies, Klaus, Sergei S. Goncharov

Publication date: 5 April 2011

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

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

zbMATH Keywords

inductive inferencecomputably enumerable setscomputable numberings

Mathematics Subject Classification ID

Computational learning theory (68Q32) Recursively (computably) enumerable sets and degrees (03D25)

Related Items

Effectivity questions for Kleene's recursion theorem, Numberings, c.e. oracles, and fixed points, Numberings and learnability

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A learning-theoretic characterization of classes of recursive functions
• Characterizing language identification in terms of computable numberings
• Autostability of models and Abelian groups
• Classical recursion theory. Vol. II
• Characterizing language identification by standardizing operations
• On a Question of Frank Stephan
• Toward a mathematical theory of inductive inference
• Language identification in the limit