Generalized notions of mind change complexity

DOI10.1016/j.ic.2003.11.001zbMath1076.68066MaRDI QIDQ1881221

Arun Sharma, Y. Ventsov, Frank Stephan

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

68Q32: Computational learning theory

68T05: Learning and adaptive systems in artificial intelligence

03D20: Recursive functions and relations, subrecursive hierarchies

Related Items

Enlarging learnable classes, Realism, rhetoric, and reliability, On the classification of recursive languages, The logic of reliable and efficient inquiry, Mind change complexity of learning logic programs, Counting extensional differences in BC-learning, Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data, Rice and Rice-Shapiro Theorems for transfinite correction grammars, Dynamically Delayed Postdictive Completeness and Consistency in Learning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparison of identification criteria for machine inductive inference
• Monotonic and dual monotonic language learning
• Elementary formal systems, intrinsic complexity, and procrastination
• Monotonic and non-monotonic inductive inference
• Classical recursion theory. Vol. II
• On the role of procrastination in machine learning
• Ordinal mind change complexity of language identification
• Mind change complexity of learning logic programs
• Incremental learning from positive data
• Characterizations of monotonic and dual monotonic language learning
• Inductive inference of formal languages from positive data
• Toward a mathematical theory of inductive inference
• LEARNING RECURSIVE LANGUAGES WITH BOUNDED MIND CHANGES
• Set-driven and rearrangement-independent learning of recursive languages
• On Properties of Regressive Sets
• Semirecursive Sets and Positive Reducibility
• Language identification in the limit
• ∏ 0 1 Classes and Degrees of Theories