Switch to: References

Add citations

You must login to add citations.
  1. Algorithmic Randomness and Measures of Complexity.George Barmpalias - 2013 - Bulletin of Symbolic Logic 19 (3):318-350.
  • Propagation of Partial Randomness.Kojiro Higuchi, W. M. Phillip Hudelson, Stephen G. Simpson & Keita Yokoyama - 2014 - Annals of Pure and Applied Logic 165 (2):742-758.
    Let f be a computable function from finite sequences of 0ʼs and 1ʼs to real numbers. We prove that strong f-randomness implies strong f-randomness relative to a PA-degree. We also prove: if X is strongly f-random and Turing reducible to Y where Y is Martin-Löf random relative to Z, then X is strongly f-random relative to Z. In addition, we prove analogous propagation results for other notions of partial randomness, including non-K-triviality and autocomplexity. We prove that f-randomness relative to a (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • Algorithmic Randomness and Measures of Complexity.George Barmpalias - 2013 - Bulletin of Symbolic Logic 19 (3):318-350.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Low Upper Bounds in the LR Degrees.David Diamondstone - 2012 - Annals of Pure and Applied Logic 163 (3):314-320.
  • A Hierarchy of Computably Enumerable Degrees.Rod Downey & Noam Greenberg - 2018 - Bulletin of Symbolic Logic 24 (1):53-89.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark