On the complexity of inductive inference
Information and Control
Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Prediction-preserving reducibility
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
On the role of procrastination in machine learning
Information and Computation
A learning-theoretic characterization of classes of recursive functions
Information Processing Letters
A recursive introduction to the theory of computation
A recursive introduction to the theory of computation
On the intrinsic complexity of learning
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
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Ordinal mind change complexity of language identification
Theoretical Computer Science
Inductive Inference: Theory and Methods
ACM Computing Surveys (CSUR)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
An Introduction to the General Theory of Algorithms
An Introduction to the General Theory of Algorithms
On the Classification of Computable Languages
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Inductive Inference of Recursive Functions: Qualitative Theory
Baltic Computer Science, Selected Papers
Inductive Inference of Recursive Functions: Complexity Bounds
Baltic Computer Science, Selected Papers
An approach to intrinsic complexity of uniform learning
Theoretical Computer Science - Algorithmic learning theory
Learning recursive functions: A survey
Theoretical Computer Science
| Hi-index | 0.00 |
The intrinsic complexity of learning compares the difficulty of learning classes of objects by using some reducibility notion. For several types of learning recursive functions, both natural complete classes are exhibited and necessary and sufficient conditions for completeness are derived. Informally, a class is complete iff both its topological structure is highly complex while its algorithmic structure is easy. Some self-describing classes turn out to be complete. Furthermore, the structure of the intrinsic complexity is shown to be much richer than the structure of the mind change complexity, though in general, intrinsic complexity and mind change complexity can behave "orthogonally".