1. Preface

   • Douglas Cenzer
   • Rebecca Weber

   EditorialNotes 10 April 2008 Pages: 529 - 531

2. Algorithmic randomness of continuous functions

   • George Barmpalias
   • Paul Brodhead
   • Rebecca Weber

   OriginalPaper 04 January 2008 Pages: 533 - 546

3. Borel complexity and computability of the Hahn–Banach Theorem

   • Vasco Brattka

   OriginalPaper 27 November 2007 Pages: 547 - 564

4. Effectively closed sets and enumerations

   • Paul Brodhead
   • Douglas Cenzer

   OriginalPaper 12 April 2008 Pages: 565 - 582

5. The anti-Specker property, a Heine–Borel property, and uniform continuity

   • Josef Berger
   • Douglas Bridges

   OriginalPaper 05 December 2007 Pages: 583 - 592

6. The elementary computable functions over the real numbers: applying two new techniques

   • Manuel L. Campagnolo
   • Kerry Ojakian

   OriginalPaper 27 November 2007 Pages: 593 - 627

7. Degrees of difficulty of generalized r.e. separating classes

   • Douglas Cenzer
   • Peter G. Hinman

   OriginalPaper 07 December 2007 Pages: 629 - 647

8. Embedding FD(ω) into \({\mathcal{P}_s}\) densely

   • Joshua A. Cole

   OriginalPaper 05 December 2007 Pages: 649 - 664

9. Schnorr trivial reals: a construction

   • Johanna N. Y. Franklin

   OriginalPaper 27 November 2007 Pages: 665 - 678

10. On degree-preserving homeomorphisms between trees in computable topology

    • Iraj Kalantari
    • Larry Welch

    OriginalPaper 27 November 2007 Pages: 679 - 693