Topological separations in inductive inference

DOI10.1016/J.TCS.2015.10.036zbMath1335.68108OpenAlexW1831898412MaRDI QIDQ5964065

John Case, Timo Kötzing

Publication date: 26 February 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.10.036

zbMATH Keywords

inductive inferencelanguage learningnon-computable learningtopological separation

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Learning in the limit with lattice-structured hypothesis spaces
• Monotonic and non-monotonic inductive inference
• Note on a central lemma for learning theory
• Learnability: Admissible, co-finite, and hypersimple languages
• Incremental learning from positive data
• Incremental concept learning for bounded data mining.
• Characterizations of monotonic and dual monotonic language learning
• Language learning from texts: Mindchanges, limited memory and monotonicity
• Learning without coding
• Topological Separations in Inductive Inference
• Iterative Learning from Positive Data and Counters
• Optimal Language Learning
• Difficulties in Forcing Fairness of Polynomial Time Inductive Inference
• Inductive inference of formal languages from positive data
• Toward a mathematical theory of inductive inference
• The Power of Vacillation in Language Learning
• Criteria of language learning
• Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations
• U-Shaped, Iterative, and Iterative-with-Counter Learning
• Language identification in the limit

This page was built for publication: Topological separations in inductive inference