Learnability: Admissible, co-finite, and hypersimple languages

Ganesh Baliga, John Case

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)26-32
Number of pages7
JournalJournal of Computer and System Sciences
Issue number1
StatePublished - Aug 1996
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Applied Mathematics
  • Computer Networks and Communications
  • Computational Theory and Mathematics


Dive into the research topics of 'Learnability: Admissible, co-finite, and hypersimple languages'. Together they form a unique fingerprint.

Cite this