Rank and randomness

Abstract

We show that for each computable ordinal α>0 it is possible to find in each Martin-L\"of random 02 degree a sequence R of Cantor-Bendixson rank α, 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…