Learning with ordinal-bounded memory from positive data

DOI10.1016/j.jcss.2012.03.002zbMath1254.68127OpenAlexW2080981465MaRDI QIDQ440010

Frank Stephan, Lorenzo Carlucci, Sanjay Jain

Publication date: 17 August 2012

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2012.03.002

zbMATH Keywords

Kolmogorov complexityinductive inferencebounded example memoryconstructive ordinals

Mathematics Subject Classification ID

Computational learning theory (68Q32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the role of procrastination in machine learning
• Ordinal mind change complexity of language identification
• Incremental learning from positive data
• Incremental concept learning for bounded data mining.
• Language learning from texts: Mindchanges, limited memory and monotonicity
• On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
• Feasible Iteration of Feasible Learning Functionals
• Learning with Temporary Memory
• Incremental Learning with Ordinal Bounded Example Memory
• Toward a mathematical theory of inductive inference
• Language identification in the limit
• On the Forms of the Predicates in the Theory of Constructive Ordinals

This page was built for publication: Learning with ordinal-bounded memory from positive data