BEING LOW ALONG A SEQUENCE AND ELSEWHERE

DOI10.1017/jsl.2018.63zbMath1443.03023OpenAlexW2911540319MaRDI QIDQ5222521

Wolfgang Merkle, Liang Yu

Publication date: 6 April 2020

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

Full work available at URL: https://doi.org/10.1017/jsl.2018.63

zbMATH Keywords

Kolmogorov complexitylownessrandomness

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Other degrees and reducibilities in computability and recursion theory (03D30) Other Turing degree structures (03D28) Algorithmic randomness and dimension (03D32)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solovay functions and their applications in algorithmic randomness
• The \(K\)-degrees, low for \(K\) degrees, and weakly low for \(K\) sets
• Lowness properties and randomness
• Lowness notions, measure and domination
• Algorithmic Randomness and Complexity
• Borel Orderings
• On initial segment complexity and degrees of randomness
• Every sequence is reducible to a random one
• Set Theory
• Every 2-random real is Kolmogorov random
• Kolmogorov Complexity and Solovay Functions
• Randomness, relativization and Turing degrees
• An introduction to Kolmogorov complexity and its applications

This page was built for publication: BEING LOW ALONG A SEQUENCE AND ELSEWHERE