On the intrinsic complexity of learning recursive functions

DOI10.1016/S0890-5401(03)00059-2MaRDI QIDQ1398370zbMATH OpenFDO

Authors Sanjay Jain, Christophe Papazian, Rolf Wiehagen, Efim Kinber, Carl H. Smith

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)

Recommendations

• Intrinsic complexity of uniform learning
• An approach to intrinsic complexity of uniform learning
• Intrinsic complexity of partial learning
• Intrinsic complexity of learning geometrical concepts from positive data
• On the intrinsic complexity of learning

Cites work

• scientific article; zbMATH DE number 3833940 (Why is no real title available?)
• scientific article; zbMATH DE number 3681743 (Why is no real title available?)
• scientific article; zbMATH DE number 3586480 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 738396 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• A learning-theoretic characterization of classes of recursive functions
• Comparison of identification criteria for machine inductive inference
• Elementary formal systems, intrinsic complexity, and procrastination
• Gödel numberings of partial recursive functions
• Inductive inference of recursive functions: complexity bounds
• Inductive inference of recursive functions: qualitative theory
• Language identification in the limit
• On one-sided versus two-sided classification
• On the classification of computable languages
• On the complexity of inductive inference
• On the intrinsic complexity of learning
• On the intrinsic complexity of learning recursive functions
• On the role of procrastination in machine learning
• Ordinal mind change complexity of language identification
• Prediction-preserving reducibility
• Recursion theoretic models of learning: Some results and intuitions
• Research in the theory of inductive inference by GDR mathematicians - A survey
• The intrinsic complexity of language identification
• The structure of intrinsic complexity of learning

Cited in

(18)

• Confident and Consistent Partial Learning of Recursive Functions
• The intrinsic difficulty of recursive functions
• scientific article; zbMATH DE number 2051904 (Why is no real title available?)
• On the intrinsic complexity of learning recursive functions
• Learning classes of approximations to non-recursive functions.
• scientific article; zbMATH DE number 1804103 (Why is no real title available?)
• Learning recursive functions: A survey
• Intrinsic complexity of partial learning
• Intrinsic complexity of partial learning
• Computability-theoretic learning complexity
• Intrinsic complexity of uniform learning
• Measuring learning complexity with criteria epitomizers
• An approach to intrinsic complexity of uniform learning
• The complexity of learning SUBSEQ(A)
• On the intrinsic complexity of learning
• Automatic functions, linear time and learning
• Active learning of recursive functions by ultrametric algorithms
• Intrinsic complexity of learning geometrical concepts from positive data

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1398370)