5 found
Sort by:
  1. Rebecca Weber (2011). Degree Invariance in the Π 0 1 Classes. Journal of Symbolic Logic 76 (4):1184-1210.
    Let ℰΠ denote the collection of all Π01 classes, ordered by inclusion. A collection of Turing degrees.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  2. George Barmpalias, Paul Brodhead, Douglas Cenzer, Jeffrey B. Remmel & Rebecca Weber (2008). Algorithmic Randomness of Continuous Functions. Archive for Mathematical Logic 46 (7-8):533-546.
    We investigate notions of randomness in the space ${{\mathcal C}(2^{\mathbb N})}$ of continuous functions on ${2^{\mathbb N}}$ . A probability measure is given and a version of the Martin-Löf test for randomness is defined. Random ${\Delta^0_2}$ continuous functions exist, but no computable function can be random and no random function can map a computable real to a computable real. The image of a random continuous function is always a perfect set and hence uncountable. For any ${y \in 2^{\mathbb N}}$ , (...)
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  3. Douglas Cenzer & Rebecca Weber (2008). Preface. Archive for Mathematical Logic 46 (7-8):529-531.
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  4. Rod Downey, Noam Greenberg & Rebecca Weber (2007). Totally Ω-Computably Enumerable Degrees and Bounding Critical Triples. Journal of Mathematical Logic 7 (02):145-171.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  5. Rod Downey, Andre Nies, Rebecca Weber & Liang Yu (2006). Lowness and Π₂⁰ Nullsets. Journal of Symbolic Logic 71 (3):1044-1052.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation