Learning theory in the arithmetic hierarchy. II.

DOI10.1007/S00153-020-00745-4zbMath1485.03184OpenAlexW3081144892MaRDI QIDQ2663335

Daniel Flores, Umar Gaffar, David J. Webb, Soowhan Yoon, Konstantinos A. Beros, Achilles A. Beros

Publication date: 16 April 2021

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-020-00745-4

zbMATH Keywords

computability theoryindex setsalgorithmic learning theorycomputably enumerable families of sets

Mathematics Subject Classification ID

Computational learning theory (68Q32) Complexity of computation (including implicit computational complexity) (03D15) Applications of computability and recursion theory (03D80)

Cites Work

• Unnamed Item
• Anomalous learning helps succinctness
• On the structure of degrees of inferability.
• On uniform learnability of language families
• The synthesis of language learners.
• LEARNING THEORY IN THE ARITHMETIC HIERARCHY
• Toward a mathematical theory of inductive inference
• The Power of Vacillation in Language Learning
• Algorithmic Learning Theory
• Anomalous Vacillatory Learning
• Language identification in the limit

This page was built for publication: Learning theory in the arithmetic hierarchy. II.