Learning theory in the arithmetic hierarchy
From MaRDI portal
Abstract: We consider the arithmetic complexity of index sets of uniformly computably enumerable families learnable under different learning criteria. We determine the exact complexity of these sets for the standard notions of finite learning, learning in the limit, behaviorally correct learning and anomalous learning in the limit. In proving the -completeness result for behaviorally correct learning we prove a result of independent interest; if a uniformly computably enumerable family is not learnable, then for any computable learner there is a enumeration witnessing failure.
Recommendations
Cites work
Cited in
(11)- An algebra of human concept learning
- Learning theory in the arithmetic hierarchy. II.
- Classifying the arithmetical complexity of teaching models
- Learning families of closed sets in matroids
- The IMP game: learnability, approximability and adversarial learning beyond ^0_1
- Learning Theory and Descriptive Set Theory
- Infinitary self-reference in learning theory
- On the Turing complexity of learning finite families of algebraic structures
- On the complexity of learning programs
- Computable PAC learning of continuous features
- PAC learning, VC dimension, and the arithmetic hierarchy
This page was built for publication: Learning theory in the arithmetic hierarchy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2933682)