Inductive inference of approximations for recursive concepts
From MaRDI portal
Publication:2581360
DOI10.1016/j.tcs.2005.09.004zbMath1081.68036OpenAlexW1987542979MaRDI QIDQ2581360
Steffen Lange, Gunter Grieser, Thomas Zeugmann
Publication date: 10 January 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.09.004
Learning theoryInductive inferenceLearning from examplesCharacterization theoremsConservative learningIndexed familiesLearning with anomaliesSet-driven learning
Cites Work
- Unnamed Item
- Unnamed Item
- Comparison of identification criteria for machine inductive inference
- Polynomial-time inference of arbitrary pattern languages
- One-sided error probabilistic inductive inference and reliable frequency identification
- Prudence and other conditions on formal language learning
- On the error correcting power of pluralism in BC-type inductive inference
- Finding patterns common to a set of strings
- The synthesis of language learners.
- Inductive inference of formal languages from positive data
- Toward a mathematical theory of inductive inference
- Ignoring data may be the only way to learn efficiently
- Set-driven and rearrangement-independent learning of recursive languages
- Inductive inference of approximations
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Language identification in the limit