Randomness for computable measures and initial segment complexity

DOI10.1016/j.apal.2016.10.014zbMath1404.03039arXiv1510.07202OpenAlexW1823933177MaRDI QIDQ508835

Christopher P. Porter, Rupert Hölzl

Publication date: 8 February 2017

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

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

zbMATH Keywords

random sequencesatomic measurescomplex sequencescomputable measuresdiminutive measurestrivial measures

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32)

Related Items

RANK AND RANDOMNESS, On trees without hyperimmune branches

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Propagation of partial randomness
• Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension
• Effectively closed sets of measures and randomness
• Strong reductions in effective randomness
• Trivial measures are not so trivial
• On effectively closed sets of effective strong measure zero
• DEMUTH’S PATH TO RANDOMNESS
• Kolmogorov complexity and the Recursion Theorem
• Algorithmic Randomness and Complexity
• Traceable Sets
• A Theory of Program Size Formally Identical to Information Theory
• K-TRIVIALS ARE NEVER CONTINUOUSLY RANDOM
• Measures and their random reals
• Kolmogorov Complexity and Solovay Functions
• Anti-Complex Sets and Reducibilities with Tiny Use
• Π₁⁰ 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
• Computational aspects of the hyperimmune-free degrees