Characterizing language identification by standardizing operations
From MaRDI portal
Publication:1333402
DOI10.1016/S0022-0000(05)80088-1zbMath0813.68147OpenAlexW2095299255MaRDI QIDQ1333402
Publication date: 13 October 1994
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0022-0000(05)80088-1
Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45) Natural language processing (68T50)
Related Items (6)
Effectivity questions for Kleene's recursion theorem ⋮ Inductive inference and computable numberings ⋮ Characterizing language identification in terms of computable numberings ⋮ Synthesizing noise-tolerant language learners ⋮ Learning languages and functions by erasing ⋮ Language learning from texts: Degrees of intrinsic complexity and their characterizations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Note on a central lemma for learning theory
- Saving the phenomena: Requirements that inductive inference machines not contradict known data
- Learning in the presence of partial explanations
- Learning with the knowledge of an upper bound on program size
- On the power of inductive inference from good examples
- Gödel numberings of partial recursive functions
- Tradeoffs in the inductive inference of nearly minimal size programs
- CONNECTIONS BETWEEN IDENTIFYING FUNCTIONALS, STANDARDIZING OPERATIONS, AND COMPUTABLE NUMBERINGS
- Toward a mathematical theory of inductive inference
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Language identification in the limit
This page was built for publication: Characterizing language identification by standardizing operations