Numberings optimal for learning

DOI10.1016/J.JCSS.2009.08.001zbMath1201.68062OpenAlexW2046502586MaRDI QIDQ972383

Frank Stephan, Sanjay Jain

Publication date: 25 May 2010

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2009.08.001

zbMATH Keywords

inductive inferencenumberingsrecursion theoryoptimal numberings

Mathematics Subject Classification ID

Computational learning theory (68Q32) Theory of numerations, effectively presented structures (03D45)

Related Items (2)

Effectivity Questions for Kleene’s Recursion Theorem ⋮ Effectivity questions for Kleene's recursion theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Prudence and other conditions on formal language learning
• Learning in Friedberg numberings
• Classical recursion theory. The theory of functions and sets of natural numbers
• Classical recursion theory. The theory of functions and sets of natural numbers.
• Learning with the knowledge of an upper bound on program size
• Separation of uniform learning classes.
• 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
• 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
• Control structures in hypothesis spaces: The influence on learning

This page was built for publication: Numberings optimal for learning