Enlarging learnable classes

DOI10.1016/J.IC.2016.09.001MaRDI QIDQ342717zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Enlarging learnable classes
• scientific article; zbMATH DE number 1453044
• scientific article; zbMATH DE number 1453045
• Learning classes of approximations to non-recursive functions.
• A learning-theoretic characterization of classes of recursive functions

Cites work

• scientific article; zbMATH DE number 605140 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Closedness properties in ex-identification
• Comparison of identification criteria for machine inductive inference
• Enlarging learnable classes
• Extremes in the degrees of inferability
• Generalized notions of mind change complexity
• Inductive inference and unsolvability
• Language identification in the limit
• Learning recursive functions: A survey
• Maximal machine learnable classes
• On one-sided versus two-sided classification
• On the classification of recursive languages
• On the structure of degrees of inferability.
• Some natural properties of strong-identification in inductive inference
• Toward a mathematical theory of inductive inference

Cited in

(2)

• Classes with easily learnable subclasses
• Enlarging learnable classes

This page was built for publication: Enlarging learnable classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342717)