Systems that learn: an introduction to learning theory for cognitive and computer scientists
Systems that learn: an introduction to learning theory for cognitive and computer scientists
Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
COLT '88 Proceedings of the first annual workshop on Computational learning theory
A Machine-Independent Theory of the Complexity of Recursive Functions
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
An Introduction to the General Theory of Algorithms
An Introduction to the General Theory of Algorithms
Machine Inductive Inference and Language Identification
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Inductive Inference of Recursive Functions: Qualitative Theory
Baltic Computer Science, Selected Papers
Elementary formal systems, intrinsic complexity, and procrastination
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Aspects of complexity of conservative probabilistic learning
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Aspects of complexity of probabilistic learning under monotonicity constraints
Theoretical Computer Science - Algorithmic learning theory
| Hi-index | 0.00 |
A new investigation of the complexity of language identification is undertaken using the notion of reduction from recursion theory and complexity theory. The approach, referred to as the intrinsic complexity of language identification, employs notions of “weak” and “strong” reduction between learnable classes of languages. The intrinsic complexity of several classes are considered and the results agree with the intuitive difficulty of learning these classes. Several complete classes are shown for both the reductions and it is also established that the weak and strong reductions are distinct.An interesting result is that the self referential class of Wiehagen in which the minimal element of every language is a grammar for the language and the class of pattern languages introduced by Angluin are equivalent in the strong sense.This study has been influenced by a similar treatment of function identification by Freivalds, Kinber, and Smith.