Learning theory in the arithmetic hierarchy

From MaRDI portal
Publication:2933682

DOI10.1017/JSL.2014.23zbMATH Open1355.03033arXiv1302.7069OpenAlexW2964267194MaRDI QIDQ2933682FDOQ2933682


Authors: Achilles A. Beros Edit this on Wikidata


Publication date: 5 December 2014

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

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 Sigma50-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 Delta20 enumeration witnessing failure.


Full work available at URL: https://arxiv.org/abs/1302.7069




Recommendations




Cites Work


Cited In (8)





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)