RANK AND RANDOMNESS

DOI10.1017/jsl.2019.65zbMath1454.03055arXiv1707.00378OpenAlexW2734263263MaRDI QIDQ5207564

Christopher P. Porter, Rupert Hölzl

Publication date: 10 January 2020

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.00378

zbMATH Keywords

Martin-Löf randomnessalgorithmic randomnesscomputable measuresCantor-Bendixson rank

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)

Cites Work

• Unnamed Item
• Unnamed Item
• Randomness for computable measures and initial segment complexity
• Index sets for \(\Pi^0_1\) classes
• Classical recursion theory. Vol. II
• Rank, join, and Cantor singletons
• Computable structures and the hyperarithmetical hierarchy
• Strong reductions in effective randomness
• The members of thin and minimal \(\Pi_1^0\) classes, their ranks and Turing degrees
• Trivial measures are not so trivial
• On the Cantor-Bendixon rank of recursively enumerable sets
• On the ranked points of a Π₁⁰ set
• Π₁⁰ classes with complex elements
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS