On the complexity of inductive inference
Information and Control
Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Identification of unions of languages drawn from an identifiable class
COLT '89 Proceedings of the second annual workshop on Computational learning theory
The correct definition of finite elasticity: corrigendum to identification of unions
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
Characterizing language identification by standardizing operations
Journal of Computer and System Sciences
Language learning from texts: mindchanges, limited memory, and monotonicity
Information and Computation
The intrinsic complexity of language identification
Journal of Computer and System Sciences
Elementary formal systems, intrinsic complexity, and procrastination
Information and Computation
On the intrinsic complexity of learning recursive functions
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
A Machine-Independent Theory of the Complexity of Recursive Functions
Journal of the ACM (JACM)
The Power of Vacillation in Language Learning
SIAM Journal on Computing
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
A Guided Tour Across the Boundaries of Learning Recursive Languages
Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report
On the intrinsic complexity of learning
EuroCOLT '95 Proceedings of the Second European Conference on Computational Learning Theory
Monotonicity versus Efficiency for Learning Languages from Texts
AII '94 Proceedings of the 4th International Workshop on Analogical and Inductive Inference: Algorithmic Learning Theory
Inductive Inference of Recursive Functions: Qualitative Theory
Baltic Computer Science, Selected Papers
Intrinsic complexity of learning geometrical concepts from positive data
Journal of Computer and System Sciences
| Hi-index | 0.00 |
The theory of learning in the limit has been a focus of study by several researchers over the last three decades. There have been several suggestions on how to measure the complexity or hardness of learning. In this paper we survey the work done in one specific such measure, called intrinsic complexity of learning. We will be mostly concentrating on learning languages, with only a brief look at function learning.