Algorithmic learning theory; Descriptive set theory; Computable structure theory; uniformity
en
Abstract:
The standard framework for studying learning problems on algebraic structures assumes that the structures in the target family are pairwise nonisomorphic. Under this assumption, the most widely investigated learning criterion--Ex-learning--becomes inherently equivalent to the well-known paradigm of Bc-learning. This paper explores what happens when the nonisomorphism requirement is removed and analyzes the extent to which these two learning criteria remain uniformly equivalent.
