Randomness, relativization and Turing degrees

@article{Nies2005RandomnessRA,
  title={Randomness, relativization and Turing degrees},
  author={A. Nies and F. Stephan and S. Terwijn},
  journal={J. Symb. Log.},
  year={2005},
  volume={70},
  pages={515-535}
}
  • A. Nies, F. Stephan, S. Terwijn
  • Published 2005
  • Mathematics, Computer Science
  • J. Symb. Log.
  • We compare various notions of algorithmic randomness. First we consider relativized randomness. A set is ?-random if it is Martin-L?f random relative to 0_1). We show that a set is 2-random if and only if there is a constant c such that infinitely many initial segments x of the set are c-incompressible: C(x) > |x| ? c. The 'only if direction was obtained independently by Joseph Miller. This characterization can be extended to the case of time-bounded C -complexity. Next we prove some results on… CONTINUE READING
    143 Citations

    Topics from this paper

    Complexity of Randomness Notions
    • PDF
    Coherent randomness tests and computing the $K$-trivial sets
    • 27
    • PDF
    Relativizing Chaitin's Halting Probability
    • 61
    • PDF
    Pointed computations and Martin-Löf randomness
    • PDF
    Degrees of computability and randomness
    • 2
    • Highly Influenced
    • PDF
    DIFFERENCE RANDOMNESS
    • 31
    • PDF
    On the Interplay between Effective Notions of Randomness and Genericity
    • PDF
    ω-Change Randomness and Weak Demuth Randomness
    • 1
    • PDF

    References

    SHOWING 1-10 OF 50 REFERENCES
    Lowness properties and randomness
    • 205
    • PDF
    The Kolmogorov complexity of random reals
    • 25
    • PDF
    On the Construction of Effective Random Sets
    • 26
    Every 2-random real is Kolmogorov random
    • J. Miller
    • Mathematics, Computer Science
    • J. Symb. Log.
    • 2004
    • 35
    • PDF
    Trivial Reals
    • 93
    • PDF
    Complexity Oscillations in Infinite Binary Sequences
    • PER MARTIN-LOF
    • 2004
    • 33
    • PDF
    The Definition of Random Sequences
    • 1,140
    • PDF
    On Relative Randomness
    • A. Kucera
    • Mathematics, Computer Science
    • Ann. Pure Appl. Log.
    • 1993
    • 42
    • Highly Influential
    Computational Randomness and Lowness
    • 97
    • PDF