Learnability: Admissible, Co-Finite, and Hypersimple Languages

摘要

Presented is a surprising characterization of hypersimple sets in algorithmic learning theory. It is used herein to obtain an elegant, tight separation result for learnability criteria. It is argued that such separation results may yield insight for eventual characterizations.