Numberings Optimal for Learning

DOI10.1007/978-3-540-87987-9_35MaRDI QIDQ3529939zbMATH OpenOpenAlexFDO

Authors Sanjay Jain, Frank Stephan

Publication date 14 October 2008

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-87987-9_35

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• Numberings optimal for learning
• Learning in Friedberg numberings
• Learning in Friedberg Numberings
• Effectivity questions for Kleene's recursion theorem
• Numberings and learnability

Cites work

• Criteria of language learning
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 3536063 (Why is no real title available?)
• scientific article; zbMATH DE number 1010621 (Why is no real title available?)
• Increasing the power of uniform inductive learners
• Inductive Inference and Computable One‐One Numberings
• Inductive inference of formal languages from positive data
• Language identification in the limit
• Learning in Friedberg Numberings
• Learning with the knowledge of an upper bound on program size
• Prudence and other conditions on formal language learning
• The Power of Vacillation in Language Learning
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Toward a mathematical theory of inductive inference

Cited in

(7)

• Effectivity questions for Kleene's recursion theorem
• Learning in Friedberg Numberings
• Hypothesis Spaces for Learning
• Hypothesis spaces for learning
• Optimal language learning from positive data
• Learning in Friedberg numberings
• Numberings optimal for learning

This page was built for publication: Numberings Optimal for Learning

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