On the intrinsic complexity of learning

DOI10.1006/inco.1995.1158zbMath1096.68635MaRDI QIDQ2508338

Rūsiņš Freivalds, Carl H. Smith, E. B. Kinber

Publication date: 10 October 2006

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1995.1158

Mathematics Subject Classification ID

68Q32: Computational learning theory

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)

03D20: Recursive functions and relations, subrecursive hierarchies

Related Items

The functions of finite support: a canonical learning problem, Explanatory and creative alternatives to the MDL principle, Control structures in hypothesis spaces: The influence on learning, Aspects of complexity of probabilistic learning under monotonicity constraints, Learning languages in a union, An approach to intrinsic complexity of uniform learning, Learning recursive functions: A survey, Quantum inductive inference by finite automata, Iterative learning of simple external contextual languages, On the intrinsic complexity of learning recursive functions, Language learning from texts: Degrees of intrinsic complexity and their characterizations, Induction by enumeration, On learning of functions refutably., Intrinsic complexity of learning geometrical concepts from positive data, Mind change efficient learning, Dynamic Modeling in Inductive Inference