Rank and randomness
From MaRDI portal
Abstract: We show that for each computable ordinal it is possible to find in each Martin-L"of random degree a sequence of Cantor-Bendixson rank , while ensuring that the sequences that inductively witness '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.
Recommendations
Cites work
- Classical recursion theory. Vol. II
- Computable structures and the hyperarithmetical hierarchy
- scientific article; zbMATH DE number 3151582 (Why is no real title available?)
- scientific article; zbMATH DE number 1390012 (Why is no real title available?)
- Index sets for ^0_1 classes
- On the Cantor-Bendixon rank of recursively enumerable sets
- On the ranked points of a Π10 set
- Randomness for computable measures and initial segment complexity
- Rank, join, and Cantor singletons
- Strong reductions in effective randomness
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- The members of thin and minimal \(\Pi_1^0\) classes, their ranks and Turing degrees
- Trivial measures are not so trivial
- Π10 classes with complex elements
This page was built for publication: Rank and randomness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5207564)