Parsimony hierarchies for inductive inference
From MaRDI portal
Publication:5311725
DOI10.2178/jsl/1080938842zbMath1068.68071MaRDI QIDQ5311725
Sanjay Jain, Andris Ambainis, John Case, Mandayam Suraj
Publication date: 29 August 2005
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2178/jsl/1080938842
computational learning theory; constructive ordinal notations; limiting computable functions; minimal size program
Related Items
Resource restricted computability theoretic learning: Illustrative topics and problems, Mathematics based on incremental learning -- excluded middle and inductive inference, Rice and Rice-Shapiro Theorems for transfinite correction grammars, Feasible Iteration of Feasible Learning Functionals, Dynamically Delayed Postdictive Completeness and Consistency in Learning
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A connotational theory of program structure
- Comparison of identification criteria for machine inductive inference
- Elementary formal systems, intrinsic complexity, and procrastination
- Finding patterns common to a set of strings
- Learning elementary formal systems
- On the role of procrastination in machine learning
- Ordinal mind change complexity of language identification
- Incremental concept learning for bounded data mining.
- On a generalized notion of mistake bounds
- Machine induction without revolutionary changes in hypothesis size
- Recursion theoretic models of learning: Some results and intuitions
- On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
- Tradeoffs in the inductive inference of nearly minimal size programs
- Periodicity in generations of automata
- Toward a mathematical theory of inductive inference
- Infinitary self-reference in learning theory
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Language identification in the limit
- Computability and Recursion
- On the Forms of the Predicates in the Theory of Constructive Ordinals
- Predictive learning models for concept drift
