Numberings Optimal for Learning

DOI10.1007/978-3-540-87987-9_35zbMath1157.68037OpenAlexW1495909147MaRDI QIDQ3529939

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)

Related Items (2)

Hypothesis spaces for learning ⋮ Hypothesis Spaces for Learning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Prudence and other conditions on formal language learning
• Learning with the knowledge of an upper bound on program size
• Increasing the power of uniform inductive learners
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Inductive Inference and Computable One‐One Numberings
• Learning in Friedberg Numberings
• Inductive inference of formal languages from positive data
• Toward a mathematical theory of inductive inference
• The Power of Vacillation in Language Learning
• Criteria of language learning
• Language identification in the limit

This page was built for publication: Numberings Optimal for Learning