Algorithmic Learning Theory

DOI10.1007/11564089MaRDI QIDQ5395042zbMATH OpenOpenAlexFDO

Authors Lorenzo Carlucci, Sanjay Jain, John Case, Frank Stephan

Publication date 1 November 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11564089

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• Non-U-shaped vacillatory and team learning
• Variations on U-shaped learning
• Memory-limited non-U-shaped learning with solved open problems
• Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations
• Memory-Limited U-Shaped Learning

Cited in

(14)

• Learning theory in the arithmetic hierarchy. II.
• scientific article; zbMATH DE number 2089566 (Why is no real title available?)
• Non-U-shaped vacillatory and team learning
• Variations on U-shaped learning
• Modes of convergence to the truth: steps toward a better epistemology of induction
• Learning Theory
• Theory and Applications of Models of Computation
• When unlearning helps
• Realism, rhetoric, and reliability
• scientific article; zbMATH DE number 1670875 (Why is no real title available?)
• Memory-limited non-U-shaped learning with solved open problems
• Results on memory-limited U-shaped learning
• Theory choice, theory change, and inductive truth-conduciveness
• Memory-Limited U-Shaped Learning

This page was built for publication: Algorithmic Learning Theory

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