Learning Theory in the Arithmetic HierarchyReport as inadecuate



 Learning Theory in the Arithmetic Hierarchy


Learning Theory in the Arithmetic Hierarchy - Download this document for free, or read online. Document in PDF available to download.

Download or read this book online for free in PDF: Learning Theory in the Arithmetic Hierarchy
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 $\Sigma 5^0$-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 $\Delta 2^0$ enumeration witnessing failure.



Author: Achilles Beros

Source: https://archive.org/







Related documents