Confident and consistent partial learning of recursive functions
From MaRDI portal
Publication:465247
DOI10.1016/j.tcs.2014.09.022zbMath1360.68526OpenAlexW2096578724MaRDI QIDQ465247
Publication date: 31 October 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.09.022
inductive inferenceconfident learningconsistent learningpartial learningfunction learningessentially class-consistent partial learning
Computational learning theory (68Q32) Recursive functions and relations, subrecursive hierarchies (03D20)
Cites Work
- Unnamed Item
- Unnamed Item
- Comparison of identification criteria for machine inductive inference
- Reflective inductive inference of recursive functions
- Learning Families of Closed Sets in Matroids
- The Boolean algebra of logic
- Toward a mathematical theory of inductive inference
- Inductive inference of automata, functions and programs
- Some decidability results on grammatical inference and complexity
- Language identification in the limit
- ∏ 0 1 Classes and Degrees of Theories
This page was built for publication: Confident and consistent partial learning of recursive functions