Generalized notions of mind change complexity

DOI10.1016/J.IC.2003.11.001MaRDI QIDQ1881221zbMATH OpenOpenAlexFDO

Authors A. K. Sharma, Frank Stephan, Y. Ventsov

Publication date 4 October 2004

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

Full work available at URL https://doi.org/10.1016/j.ic.2003.11.001

zbMATH Keywords

predictive errors of commission

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computational learning theory (68Q32) Recursive functions and relations, subrecursive hierarchies (03D20)

Recommendations

• scientific article; zbMATH DE number 512873
• Learning Theory
• LEARNING RECURSIVE LANGUAGES WITH BOUNDED MIND CHANGES
• INDUCTIVE INFERENCE OF LIMITING PROGRAMS WITH BOUNDED NUMBER OF MIND CHANGES
• Mind change complexity of learning logic programs

Cites work

• scientific article; zbMATH DE number 3952736 (Why is no real title available?)
• scientific article; zbMATH DE number 3518782 (Why is no real title available?)
• scientific article; zbMATH DE number 517033 (Why is no real title available?)
• scientific article; zbMATH DE number 1176133 (Why is no real title available?)
• Characterizations of monotonic and dual monotonic language learning
• Classical recursion theory. Vol. II
• Comparison of identification criteria for machine inductive inference
• Elementary formal systems, intrinsic complexity, and procrastination
• Incremental learning from positive data
• Inductive inference of formal languages from positive data
• LEARNING RECURSIVE LANGUAGES WITH BOUNDED MIND CHANGES
• Language identification in the limit
• Mind change complexity of learning logic programs
• Monotonic and dual monotonic language learning
• Monotonic and non-monotonic inductive inference
• On Properties of Regressive Sets
• On the role of procrastination in machine learning
• Ordinal mind change complexity of language identification
• Semirecursive Sets and Positive Reducibility
• Set-driven and rearrangement-independent learning of recursive languages
• Toward a mathematical theory of inductive inference
• ∏ 0 1 Classes and Degrees of Theories

Cited in

(15)

• General inductive inference types based on linearly-ordered sets
• scientific article; zbMATH DE number 1670728 (Why is no real title available?)
• scientific article; zbMATH DE number 1416102 (Why is no real title available?)
• Rice and Rice-Shapiro theorems for transfinite correction grammars
• Enlarging learnable classes
• Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data
• Dynamically Delayed Postdictive Completeness and Consistency in Learning
• Mind change complexity of learning logic programs
• Realism, rhetoric, and reliability
• Learning Theory
• Counting extensional differences in BC-learning
• Set systems: order types, continuous nondeterministic deformations, and quasi-orders
• Theory choice, theory change, and inductive truth-conduciveness
• On the classification of recursive languages
• The logic of reliable and efficient inquiry

This page was built for publication: Generalized notions of mind change complexity

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