Strongly non-U-shaped language learning results by general techniques

DOI10.1016/j.ic.2016.06.015zbMath1370.68149OpenAlexW2470848396MaRDI QIDQ342700

John Case, Timo Kötzing

Publication date: 18 November 2016

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2016.06.015

zbMATH Keywords

inductive inferencegeneral techniquesinfinitary self-referential programsnon-U-shaped learningself-learning classes

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Related Items (7)

A solution to Wiehagen's thesis ⋮ Learners based on transducers ⋮ Maps of restrictions for behaviourally correct learning ⋮ Learning languages with decidable hypotheses ⋮ Mapping monotonic restrictions in inductive inference ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Iterative learning from positive data and counters
• Comparison of identification criteria for machine inductive inference
• Optimal language learning from positive data
• Prudence and other conditions on formal language learning
• When unlearning helps
• Non-U-shaped vacillatory and team learning
• U-shaped, iterative, and iterative-with-counter learning
• Parallelism increases iterative learning power
• Classical recursion theory. Vol. II
• Incremental concept learning for bounded data mining.
• Memory-limited non-U-shaped learning with solved open problems
• Computability-theoretic learning complexity
• Dynamically Delayed Postdictive Completeness and Consistency in Learning
• Periodicity in generations of automata
• Toward a mathematical theory of inductive inference
• The Power of Vacillation in Language Learning
• Infinitary self-reference in learning theory
• Criteria of language learning
• Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Some decidability results on grammatical inference and complexity
• Language identification in the limit
• Topological separations in inductive inference

This page was built for publication: Strongly non-U-shaped language learning results by general techniques