Randomness, Lowness and Degrees

Journal of Symbolic Logic 73 (2):559 - 577 (2008)
Abstract
We say that A ≤LR B if every B-random number is A-random. Intuitively this means that if oracle A can identify some patterns on some real γ. In other words. B is at least as good as A for this purpose. We study the structure of the LR degrees globally and locally (i.e., restricted to the computably enumberable degrees) and their relationship with the Turing degrees. Among other results we show that whenever α in not GL₂ the LR degree of α bounds $2^{\aleph _{0}}$ degrees (so that, in particular, there exist LR degrees with uncountably many predecessors) and we give sample results which demonstrate how various techniques from the theory of the c.e. degrees can be used to prove results about the c.e. LR degrees
Keywords No keywords specified (fix it)
Categories (categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 9,357
External links
  •   Try with proxy.
  • Through your library Configure
    References found in this work BETA

    No references found.

    Citations of this work BETA
    David Diamondstone (2012). Low Upper Bounds in the LR Degrees. Annals of Pure and Applied Logic 163 (3):314-320.
    Similar books and articles
    Joseph Berkovitz, Roman Frigg & Fred Kronz (2006). The Ergodic Hierarchy, Randomness and Hamiltonian Chaos. Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics 37 (4):661-691.
    Roman Frigg (2006). The Ergodic Hierarchy, Randomness and Hamiltonian Chaos. Studies in History and Philosophy of Science Part B 37 (4):661-691.
    Rodney G. Downey & Evan J. Griffiths (2004). Schnorr Randomness. Journal of Symbolic Logic 69 (2):533 - 554.
    Antony Eagle, Chance Versus Randomness. Stanford Encyclopedia of Philosophy.
    Guohua Wu (2004). Bi-Isolation in the D.C.E. Degrees. Journal of Symbolic Logic 69 (2):409 - 420.
    Analytics

    Monthly downloads

    Sorry, there are not enough data points to plot this chart.

    Added to index

    2010-08-24

    Total downloads

    1 ( #306,128 of 1,088,753 )

    Recent downloads (6 months)

    0

    How can I increase my downloads?

    My notes
    Sign in to use this feature


    Discussion
    Start a new thread
    Order:
    There  are no threads in this forum
    Nothing in this forum yet.