✦ LIBER ✦
Learnability: Admissible, Co-Finite, and Hypersimple Languages
✍ Scribed by Ganesh Baliga; John Case
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 455 KB
- Volume
- 53
- Category
- Article
- ISSN
- 0022-0000
No coin nor oath required. For personal study only.
✦ Synopsis
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.