Rank and Randomness

@article{Hlzl2019RankAR,
  title={Rank and Randomness},
  author={R. H{\"o}lzl and Christopher P. Porter},
  journal={J. Symb. Log.},
  year={2019},
  volume={84},
  pages={1527-1543}
}
  • R. Hölzl, Christopher P. Porter
  • Published 2019
  • Computer Science, Mathematics
  • J. Symb. Log.
    • We show that for each computable ordinal $\alpha>0$ it is possible to find in each Martin-L\"of random $\Delta^0_2$ degree a sequence $R$ of Cantor-Bendixson rank $\alpha$, while ensuring that the sequences that inductively witness $R$'s rank are all Martin-L\"of random with respect to a single countably supported and computable measure. This is a strengthening for random degrees of a recent result of Downey, Wu, and Yang, and can be understood as a randomized version of it. 
    View PDF on arXiv

    Topics from this paper

    Explore Further: Topics Discussed in This Paper

    References

    SHOWING 1-10 OF 15 REFERENCES
    Strong reductions in effective randomness
    • 24
    • PDF
    The members of thin and minimal classes, their ranks and Turing degrees
    • 2
    • Highly Influential
    • PDF
    Rank, join, and Cantor singletons
    • J. Owings
    • Mathematics, Computer Science
    • Arch. Math. Log.
    • 1997
    • 3
    Π⁰₁ classes with complex elements
    • 11
    • PDF
    Randomness for computable measures and initial segment complexity
    • 2
    • PDF
    Trivial Measures are not so Trivial
    • 4
    • PDF
    Computable structures and the hyperarithmetical hierarchy
    • 368
    Π 1 classes in computability theory, Handbook of Computability Theory, Studies
    • Logic and the Foundations of Mathematics,
    • 1999
    On the Cantor-Bendixon Rank of Recursively Enumerable Sets
    • 9
    • Highly Influential
    Degrees of random sets
    • 121