Low for random reals and positive-measure domination

DOI10.1090/S0002-9939-07-08648-0zbMath1128.03031arXiv1408.2171OpenAlexW3101610980MaRDI QIDQ5308140

Bjørn Kjos-Hanssen

Publication date: 27 September 2007

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Other Turing degree structures (03D28)

Related Items

Randomness notions and partial relativization, Randomness, lowness and degrees, Low upper bounds in the LR degrees, HIGHER RANDOMNESS AND GENERICITY, Effectively approximating measurable sets by open sets, Elementary differences between the degrees of unsolvability and degrees of compressibility, MASS PROBLEMS AND HYPERARITHMETICITY, On very high degrees, Two more characterizations of \(K\)-triviality, \(\Pi_1^0 \) classes, LR degrees and Turing degrees, Lowness for bounded randomness, Lowness for effective Hausdorff dimension, The importance of Π₁⁰ classes in effective randomness, Non-cupping, measure and computably enumerable splittings, 𝐾-trivial degrees and the jump-traceability hierarchy, Tracing and domination in the Turing degrees, Randomness and lowness notions via open covers, Mass problems associated with effectively closed sets, Mass Problems and Measure-Theoretic Regularity

Cites Work

• Unnamed Item
• Lowness properties and randomness
• Computational randomness and lowness
• Uniform almost everywhere domination
• A Theory of Program Size Formally Identical to Information Theory
• Using random sets as oracles
• Almost everywhere domination
• Lowness for the Class of Schnorr Random Reals
• On a conjecture of Dobrinen and Simpson concerning almost everywhere domination
• A unified approach to the definition of random sequences
• Randomness, relativization and Turing degrees