Intrinsic Complexity of Partial Learning
A partial learner in the limit , given a representation of the target language (a text), outputs a sequence of conjectures, where one correct conjecture appears infinitely many times and other conjectures each appear a finite number of times. Following  and , we define intrinsic complexity of partial learning, based on reducibilities between learning problems. Although the whole class of recursively enumerable languages is partially learnable (see ) and, thus, belongs to the complete learnability degree, we discovered a rich structure of incomplete degrees, reflecting different types of learning strategies (based, to some extent, on topological structures of the target language classes). We also exhibit examples of complete classes that illuminate the character of the strategies for partial learning of the hardest classes.
Jain, S. & Kinber, E. (2019). Intrinsic complexity of partial learning. Theoretical Computer Science, 776, 43-63. Doi:10.1016/j.tcs.2018.12.022