Characterizing language identification in terms of computable numberings
DOI10.1016/S0168-0072(95)00064-XzbMATH Open0865.03037OpenAlexW2027220218MaRDI QIDQ676311FDOQ676311
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
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
Learning and adaptive systems in artificial intelligence (68T05) Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45)
Cites Work
- Title not available (Why is that?)
- Inductive inference of formal languages from positive data
- Toward a mathematical theory of inductive inference
- Title not available (Why is that?)
- Language identification in the limit
- Prudence and other conditions on formal language learning
- Learning with the knowledge of an upper bound on program size
- Title not available (Why is that?)
- LEARNING RECURSIVE LANGUAGES WITH BOUNDED MIND CHANGES
- Monotonic and dual monotonic language learning
- Research in the theory of inductive inference by GDR mathematicians - A survey
- Gödel numberings of partial recursive functions
- Learning in the presence of partial explanations
- Characterizing language identification by standardizing operations
- Title not available (Why is that?)
- CONNECTIONS BETWEEN IDENTIFYING FUNCTIONALS, STANDARDIZING OPERATIONS, AND COMPUTABLE NUMBERINGS
- Title not available (Why is that?)
- Title not available (Why is that?)
- Prudence in vacillatory language identification
Cited In (10)
- Identifying terminal distinguishable languages
- 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 and computable numberings
- Learning in Friedberg Numberings
- Synthesizing noise-tolerant language learners
- Title not available (Why is that?)
- Title not available (Why is that?)
- Inductive inference systems for learning classes of algorithmically generated sets and structures
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)
