We study learning of indexable families of recursive languages from go
od examples. We show that this approach can be considerably more power
ful than learning from all examples and point out reasons for this add
itional power. We present several characterizations of types of learni
ng from good examples. We derive similarities as well as differences t
o learning of recursive functions from good examples.