Enlarging learnable classes

DOI10.1016/J.IC.2016.09.001zbMath1432.68208OpenAlexW2519727250MaRDI QIDQ342717

Timo Kötzing, Frank Stephan, Sanjay Jain

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.09.001

zbMATH Keywords

inductive inferencelearning in the limitnon-union theoremtotal recursive functions

Mathematics Subject Classification ID

Computational learning theory (68Q32) Recursive functions and relations, subrecursive hierarchies (03D20)

Cites Work

• Unnamed Item
• Unnamed Item
• Comparison of identification criteria for machine inductive inference
• On the classification of recursive languages
• Learning recursive functions: A survey
• On the structure of degrees of inferability.
• Some natural properties of strong-identification in inductive inference
• Maximal machine learnable classes
• Extremes in the degrees of inferability
• On one-sided versus two-sided classification
• Generalized notions of mind change complexity
• Enlarging Learnable Classes
• Inductive inference and unsolvability
• Toward a mathematical theory of inductive inference
• Language identification in the limit
• Closedness properties in ex-identification

This page was built for publication: Enlarging learnable classes