Learning with refutation
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3932417 (Why is no real title available?)
- scientific article; zbMATH DE number 1351096 (Why is no real title available?)
- scientific article; zbMATH DE number 605140 (Why is no real title available?)
- scientific article; zbMATH DE number 2077177 (Why is no real title available?)
- scientific article; zbMATH DE number 2077180 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- A Machine-Independent Theory of the Complexity of Recursive Functions
- A note on batch and incremental learnability
- Language identification in the limit
- Learning approximately regular languages with reversible languages
- Prudence and other conditions on formal language learning
- Some natural properties of strong-identification in inductive inference
- Towards a mathematical theory of machine discovery from facts
Cited in
(8)- scientific article; zbMATH DE number 2077177 (Why is no real title available?)
- Refuting learning revisited.
- Reflective inductive inference of recursive functions
- On learning of functions refutably.
- Refutable language learning with a neighbor system.
- On an open problem in classification of languages
- Learning with Rejection
- scientific article; zbMATH DE number 2080665 (Why is no real title available?)
This page was built for publication: Learning with refutation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1278041)