Inductive inference and computable numberings

DOI10.1016/J.TCS.2010.12.041MaRDI QIDQ2430009zbMATH OpenOpenAlexFDO

Authors Serikzhan A. Badaev, Klaus Ambos-Spies, S. 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

computable numberingscomputably enumerable setsinductive inference

Mathematics Subject Classification ID

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

Recommendations

• Numberings and learnability
• On a Question of Frank Stephan
• Learning theory in the arithmetic hierarchy. II.
• Characterizing language identification in terms of computable numberings
• Computable numberings of families of infinite sets

Cites work

• A learning-theoretic characterization of classes of recursive functions
• Autostability of models and Abelian groups
• Characterizing language identification by standardizing operations
• Characterizing language identification in terms of computable numberings
• Classical recursion theory. Vol. II
• scientific article; zbMATH DE number 3664931 (Why is no real title available?)
• scientific article; zbMATH DE number 2063214 (Why is no real title available?)
• scientific article; zbMATH DE number 1531919 (Why is no real title available?)
• scientific article; zbMATH DE number 1390024 (Why is no real title available?)
• scientific article; zbMATH DE number 3254884 (Why is no real title available?)
• Language identification in the limit
• On a Question of Frank Stephan
• Toward a mathematical theory of inductive inference

Cited in

(9)

• Learnability and positive equivalence relations
• Numberings and learnability
• Effectivity questions for Kleene's recursion theorem
• Learning theory in the arithmetic hierarchy. II.
• Learning theory in the arithmetic hierarchy
• Inductive Inference and Reverse Mathematics
• On a Question of Frank Stephan
• Numberings, c.e. oracles, and fixed points
• On computable numberings of families of Turing degrees

This page was built for publication: Inductive inference and computable numberings

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