Extensional set learning (extended abstract)
Sebastiaan A. Terwijn · 1999
We investigate the model recBC of learning of r.e.sets, where changes in hypotheses only count when there is an extensional difference.We study the learnability of collections that are uniformly r.e.We prove that, in contrast with the case of uniformly recursive collections, identifiability does not imply recursive BC-identifiability.This answers a question of D. de Jongh.In contrast to the model of recursive identifiability, we prove that the BCmodel separates the notions of finite thickness and finite elasticity.