Learning in Friedberg Numberings

DOI10.1007/978-3-540-75225-7_10zbMath1142.68394OpenAlexW1504713964MaRDI QIDQ3520051

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

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

Related Items (2)

Prescribed Learning of R.E. Classes ⋮ Numberings Optimal for Learning

Cites Work

• Characterizing language identification in terms of computable numberings
• Monotonic and non-monotonic inductive inference
• Prudence and other conditions on formal language learning
• When unlearning helps
• Finding patterns common to a set of strings
• Classical recursion theory. The theory of functions and sets of natural numbers
• Variations on U-shaped learning
• 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
• Memory-Limited U-Shaped Learning
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Language identification in the limit
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Learning in Friedberg Numberings