Cautious limit learning
From MaRDI portal
Cites work
- A Machine-Independent Theory of the Complexity of Recursive Functions
- A map of update constraints in inductive inference
- Criteria of language learning
- scientific article; zbMATH DE number 3932417 (Why is no real title available?)
- Inductive inference of formal languages from positive data
- Language identification in the limit
- Learning strategies
- Normal forms in semantic language identification
- Optimal language learning from positive data
- Periodicity in generations of automata
- Prudence and other conditions on formal language learning
- Strongly non-U-shaped language learning results by general techniques
- Systems that learn. An introduction to learning theory for cognitive and computer scientists
- Toward a mathematical theory of inductive inference
- Towards an atlas of computational learning theory
- Variations on U-shaped learning
Cited in
(10)- On the Weihrauch degree of the additive Ramsey theorem
- Hilbert's tenth problem for term algebras with a substitution operator
- Complemented subsets and Boolean-valued, partial functions
- Defining long words succinctly in FO and MSO
- On the first-order parts of problems in the Weihrauch degrees
- Algorithmically random series
- Ideal presentations and numberings of some classes of effective quasi-Polish spaces
- Lower bounds on () and other properties of -register machines
- Reifying dynamical algebra: maximal ideals in countable rings, constructively
- Maps for learning indexable classes
This page was built for publication: Cautious limit learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7025142)
