Learning with refutation

DOI10.1006/jcss.1998.1591zbMath0936.68058OpenAlexW2091011377MaRDI QIDQ1278041

Sanjay Jain

Publication date: 21 February 1999

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1998.1591

zbMATH Keywords

learning situation

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Related Items

Refutable language learning with a neighbor system. ⋮ On learning of functions refutably. ⋮ Refuting learning revisited. ⋮ On an open problem in classification of languages ⋮ Reflective inductive inference of recursive functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Towards a mathematical theory of machine discovery from facts
• Prudence and other conditions on formal language learning
• Some natural properties of strong-identification in inductive inference
• Learning approximately regular languages with reversible languages
• A note on batch and incremental learnability
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Language identification in the limit