Summary

Concept learning as search through $H$
General-to-specific ordering over $H$
Version space candidate elimination algorithm
$S$ and $G$ boundaries characterize learner's uncertainty
Learner can generate useful queries
Inductive leaps possible only if learner is biased
Inductive learners can be modeled by equivalent deductive systems