Optimal language learning from positive data
From MaRDI portal
Recommendations
Cites work
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Analogical and inductive inference. International workshop AII '89, Reinhardsbrunn Castle, GDR, October 1-6, 1989. Proceedings
- Comparison of identification criteria for machine inductive inference
- scientific article; zbMATH DE number 3833940 (Why is no real title available?)
- scientific article; zbMATH DE number 517033 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- Inductive inference of automata, functions and programs
- Inductive inference of formal languages from positive data
- Language identification in the limit
- Learning strategies
- Non-U-shaped vacillatory and team learning
- Prudence and other conditions on formal language learning
- Results on memory-limited U-shaped learning
- Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations
- Toward a mathematical theory of inductive inference
- U-shaped, iterative, and iterative-with-counter learning
- When unlearning helps
Cited in
(20)- Towards a map for incremental learning in the limit from positive and negative information
- Learning languages in the limit from positive information with finitely many memory changes
- `Ideal learning' of natural language: positive results about learning from positive evidence
- A map of update constraints in inductive inference
- Strongly non-U-shaped language learning results by general techniques
- Optimal Language Learning
- MDL in the limit
- scientific article; zbMATH DE number 2080663 (Why is no real title available?)
- Algorithmic Learning Theory
- 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
- Cautious limit learning
This page was built for publication: Optimal language learning from positive data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q642522)