Learning in the presence of partial explanations
From MaRDI portal
Publication:1183607
DOI10.1016/0890-5401(91)90043-2zbMath0765.68166OpenAlexW2171290626MaRDI QIDQ1183607
Publication date: 28 June 1992
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0890-5401(91)90043-2
Related Items (5)
Characterizing language identification by standardizing operations ⋮ On the Influence of Technology on Learning Processes ⋮ Characterizing language identification in terms of computable numberings ⋮ Robust learning with infinite additional information ⋮ Inductive inference with additional information.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Comparison of identification criteria for machine inductive inference
- Prudence and other conditions on formal language learning
- Finding patterns common to a set of strings
- Research in the theory of inductive inference by GDR mathematicians - A survey
- Inductive inference with additional information.
- Approximation of functions on the integers
- Gödel numberings of partial recursive functions
- Aggregating inductive expertise
- Probabilistic inductive inference
- Inductive inference of formal languages from positive data
- The Power of Pluralism for Automatic Program Synthesis
- Toward a mathematical theory of inductive inference
- Inductive inference of approximations
- Criteria of language learning
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Language identification in the limit
This page was built for publication: Learning in the presence of partial explanations