Learning in Friedberg Numberings

DOI10.1007/978-3-540-75225-7_10MaRDI QIDQ3520051zbMATH OpenOpenAlexFDO

Authors Sanjay Jain, Frank Stephan

Publication date 19 August 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-75225-7_10

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Computational learning theory (68Q32) Formal languages and automata (68Q45)

Recommendations

• Learning in Friedberg numberings
• Numberings optimal for learning
• Numberings Optimal for Learning
• Numberings and learnability
• A learning-theoretic characterization of classes of recursive functions

Cites work

• A Machine-Independent Theory of the Complexity of Recursive Functions
• Characterizing language identification in terms of computable numberings
• Classical recursion theory. The theory of functions and sets of natural numbers
• Criteria of language learning
• Finding patterns common to a set of strings
• scientific article; zbMATH DE number 3833940 (Why is no real title available?)
• scientific article; zbMATH DE number 3863176 (Why is no real title available?)
• scientific article; zbMATH DE number 3932417 (Why is no real title available?)
• scientific article; zbMATH DE number 3536063 (Why is no real title available?)
• scientific article; zbMATH DE number 3539202 (Why is no real title available?)
• scientific article; zbMATH DE number 517033 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Inductive Inference and Computable One‐One Numberings
• Inductive inference of formal languages from positive data
• Language identification in the limit
• Memory-Limited U-Shaped Learning
• Monotonic and non-monotonic inductive inference
• 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
• Variations on U-shaped learning
• When unlearning helps

Cited in

(6)

• Learning-theoretic perspectives of acceptable numberings
• Numberings and learnability
• Prescribed Learning of R.E. Classes
• Numberings Optimal for Learning
• Learning in Friedberg numberings
• Numberings optimal for learning

This page was built for publication: Learning in Friedberg Numberings

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