Characterizing language identification in terms of computable numberings

DOI10.1016/S0168-0072(95)00064-XMaRDI QIDQ676311zbMATH OpenOpenAlexFDO

Authors Sanjay Jain, A. K. Sharma

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)

Recommendations

• Characterizing language identification by standardizing operations
• The intrinsic complexity of language identification
• Investigations on measure-one identification of classes of languages
• scientific article; zbMATH DE number 67629
• On the non-existence of maximal inference degrees for language identification
• Identification in the Limit of Systematic-Noisy Languages
• On counting functions of languages

Cites work

• scientific article; zbMATH DE number 996382 (Why is no real title available?)
• scientific article; zbMATH DE number 3932417 (Why is no real title available?)
• scientific article; zbMATH DE number 3681743 (Why is no real title available?)
• scientific article; zbMATH DE number 1351096 (Why is no real title available?)
• scientific article; zbMATH DE number 1351107 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• CONNECTIONS BETWEEN IDENTIFYING FUNCTIONALS, STANDARDIZING OPERATIONS, AND COMPUTABLE NUMBERINGS
• Characterizing language identification by standardizing operations
• Gödel numberings of partial recursive functions
• Inductive inference of formal languages from positive data
• LEARNING RECURSIVE LANGUAGES WITH BOUNDED MIND CHANGES
• Language identification in the limit
• Learning in the presence of partial explanations
• Learning with the knowledge of an upper bound on program size
• Monotonic and dual monotonic language learning
• Prudence and other conditions on formal language learning
• Prudence in vacillatory language identification
• Research in the theory of inductive inference by GDR mathematicians - A survey
• Toward a mathematical theory of inductive inference

Cited in

(10)

• Inductive inference and computable numberings
• Synthesizing noise-tolerant language learners
• Identifying terminal distinguishable languages
• scientific article; zbMATH DE number 3859102 (Why is no real title available?)
• Learning in Friedberg Numberings
• The position of index sets of identifiable sets in the arithmetical hierarchy
• Effectivity questions for Kleene's recursion theorem
• Inductive inference systems for learning classes of algorithmically generated sets and structures
• Learning in Friedberg numberings
• scientific article; zbMATH DE number 2077152 (Why is no real title available?)

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

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