Generalized notions of mind change complexity
From MaRDI portal
Publication:1881221
DOI10.1016/j.ic.2003.11.001zbMath1076.68066OpenAlexW2091143072MaRDI QIDQ1881221
Frank Stephan, Arun Sharma, 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
Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05) Recursive functions and relations, subrecursive hierarchies (03D20)
Related Items (10)
Counting extensional differences in BC-learning ⋮ Enlarging learnable classes ⋮ On the classification of recursive languages ⋮ Dynamically Delayed Postdictive Completeness and Consistency in Learning ⋮ Realism, rhetoric, and reliability ⋮ Theory choice, theory change, and inductive truth-conduciveness ⋮ Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data ⋮ Rice and Rice-Shapiro Theorems for transfinite correction grammars ⋮ The logic of reliable and efficient inquiry ⋮ Mind change complexity of learning logic programs
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
This page was built for publication: Generalized notions of mind change complexity
