Characterizing language identification in terms of computable numberings

DOI10.1016/S0168-0072(95)00064-XzbMath0865.03037OpenAlexW2027220218MaRDI QIDQ676311

Arun Sharma, Sanjay Jain

Publication date: 11 June 1997

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0168-0072(95)00064-x

zbMATH Keywords

indexinductive inferencelanguage identificationcomputable numberingslearning r.e. sets

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45)

Related Items (5)

Effectivity questions for Kleene's recursion theorem ⋮ Inductive inference and computable numberings ⋮ Learning in Friedberg Numberings ⋮ Learning in Friedberg numberings ⋮ Synthesizing noise-tolerant language learners

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Monotonic and dual monotonic language learning
• Prudence and other conditions on formal language learning
• Research in the theory of inductive inference by GDR mathematicians - A survey
• Learning in the presence of partial explanations
• Learning with the knowledge of an upper bound on program size
• Characterizing language identification by standardizing operations
• Gödel numberings of partial recursive functions
• CONNECTIONS BETWEEN IDENTIFYING FUNCTIONALS, STANDARDIZING OPERATIONS, AND COMPUTABLE NUMBERINGS
• Inductive inference of formal languages from positive data
• Toward a mathematical theory of inductive inference
• LEARNING RECURSIVE LANGUAGES WITH BOUNDED MIND CHANGES
• Prudence in vacillatory language identification
• Language identification in the limit

This page was built for publication: Characterizing language identification in terms of computable numberings