Robust behaviorally correct learning.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4055080 (Why is no real title available?)
- scientific article; zbMATH DE number 67627 (Why is no real title available?)
- scientific article; zbMATH DE number 3246229 (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
- Comparison of identification criteria for machine inductive inference
- Inductive inference of recursive functions: qualitative theory
- Language identification in the limit
- On learning multiple concepts in parallel
- Periodicity in generations of automata
- Research in the theory of inductive inference by GDR mathematicians - A survey
- Robust separations in inductive inference
- Toward a mathematical theory of inductive inference
- Training sequences
Cited in
(9)- Maps of restrictions for behaviourally correct learning
- Transformations that preserve learnability
- Robust learning is rich
- Avoiding coding tricks by hyperrobust learning
- Robust learning -- rich and poor
- Learning recursive functions: A survey
- scientific article; zbMATH DE number 1670728 (Why is no real title available?)
- Robust separations in inductive inference
- Learning classes of approximations to non-recursive functions.
This page was built for publication: Robust behaviorally correct learning.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854310)