1. Introduction: Special issue on computational learning theory

   • Leonard Pitt

   EditorialNotes Pages: 117 - 120

2. Introduction: Special Issue on Computational Learning Theory

   • Leonard Pitt

   Introduction Pages: 117 - 120

3. Negative Results for Equivalence Queries

   • Dana Angluin

   OriginalPaper Pages: 121 - 150

4. Negative results for equivalence queries

   • Dana Angluin

   OriginalPaper Pages: 121 - 150

5. Polynomial time learnability of simple deterministic languages

   • Hiroki Ishizaka

   OriginalPaper Pages: 151 - 164

6. Polynomial Time Learnability of Simple Deterministic Languages

   • Hiroki Ishizaka

   OriginalPaper Pages: 151 - 164

7. Learning Nested Differences of Intersection-Closed Concept Classes

   • David Helmbold
   • Robert Sloan
   • Manfred K. Warmuth

   OriginalPaper Pages: 165 - 196

8. Learning nested differences of intersection-closed concept classes

   • David Helmbold
   • Robert Sloan
   • Manfred K. Warmuth

   OriginalPaper Pages: 165 - 196

9. The strength of weak learnability

   • Robert E. Schapire

   OriginalPaper Pages: 197 - 227

10. The Strength of Weak Learnability

    • Robert E. Schapire

    OriginalPaper Pages: 197 - 227

11. Errata

    Erratum Pages: 229 - 229