A note on batch and incremental learnability

DOI10.1006/JCSS.1998.1568zbMath0948.68162OpenAlexW2058024065MaRDI QIDQ1271611

Arun Sharma

Publication date: 10 November 1998

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

Full work available at URL: https://doi.org/10.1006/jcss.1998.1568

zbMATH Keywords

recursively enumerable languages

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (4)

On the learnability of vector spaces ⋮ On ordinal VC-dimension and some notions of complexity ⋮ Vacillatory and BC learning on noisy data ⋮ Learning with refutation

Uses Software

• GOLEM

Cites Work

• Unnamed Item
• Unnamed Item
• Comparison of identification criteria for machine inductive inference
• Toward a mathematical theory of inductive inference
• Language identification in the limit

This page was built for publication: A note on batch and incremental learnability