On the intrinsic complexity of learning recursive functions

DOI10.1016/S0890-5401(03)00059-2zbMath1028.68120MaRDI QIDQ1398370

Christophe Papazian, Sanjay Jain, Rolf Wiehagen, Carl H. Smith, E. B. Kinber

Publication date: 29 July 2003

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

zbMATH Keywords

reducibilitylearning classes of objects

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (5)

An approach to intrinsic complexity of uniform learning ⋮ Intrinsic complexity of partial learning ⋮ On the intrinsic complexity of learning recursive functions ⋮ Learning recursive functions: A survey ⋮ Intrinsic Complexity of Partial Learning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparison of identification criteria for machine inductive inference
• A learning-theoretic characterization of classes of recursive functions
• Elementary formal systems, intrinsic complexity, and procrastination
• Prediction-preserving reducibility
• Research in the theory of inductive inference by GDR mathematicians - A survey
• On the role of procrastination in machine learning
• On the intrinsic complexity of learning recursive functions
• On one-sided versus two-sided classification
• Ordinal mind change complexity of language identification
• The intrinsic complexity of language identification
• Recursion theoretic models of learning: Some results and intuitions
• On the intrinsic complexity of learning
• Gödel numberings of partial recursive functions
• On the complexity of inductive inference
• The structure of intrinsic complexity of learning
• Inductive inference of recursive functions: Qualitative theory
• Inductive inference of recursive functions: Complexity bounds
• On the classification of computable languages
• Language identification in the limit

This page was built for publication: On the intrinsic complexity of learning recursive functions