Algorithmic randomness of continuous functions George BarmpaliasPaul BrodheadRebecca Weber OriginalPaper 04 January 2008 Pages: 533 - 546
Borel complexity and computability of the Hahn–Banach Theorem Vasco Brattka OriginalPaper 27 November 2007 Pages: 547 - 564
Effectively closed sets and enumerations Paul BrodheadDouglas Cenzer OriginalPaper 12 April 2008 Pages: 565 - 582
The anti-Specker property, a Heine–Borel property, and uniform continuity Josef BergerDouglas Bridges OriginalPaper 05 December 2007 Pages: 583 - 592
The elementary computable functions over the real numbers: applying two new techniques Manuel L. CampagnoloKerry Ojakian OriginalPaper 27 November 2007 Pages: 593 - 627
Degrees of difficulty of generalized r.e. separating classes Douglas CenzerPeter G. Hinman OriginalPaper 07 December 2007 Pages: 629 - 647
Embedding FD(ω) into \({\mathcal{P}_s}\) densely Joshua A. Cole OriginalPaper 05 December 2007 Pages: 649 - 664
Schnorr trivial reals: a construction Johanna N. Y. Franklin OriginalPaper 27 November 2007 Pages: 665 - 678
On degree-preserving homeomorphisms between trees in computable topology Iraj KalantariLarry Welch OriginalPaper 27 November 2007 Pages: 679 - 693