Lowness notions, measure and domination
From MaRDI portal
Publication:2890316
DOI10.1112/jlms/jdr072zbMath1262.03068arXiv1408.2898OpenAlexW2104062136MaRDI QIDQ2890316
Joseph S. Miller, Bjørn Kjos-Hanssen, D. Reed Solomon
Publication date: 8 June 2012
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.2898
Turing degreesLRLK\(K\)-trivialalmost everywhere dominationlowness for weak 2-randomnessregularity of Lebesgue measure
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Other Turing degree structures (03D28) Algorithmic randomness and dimension (03D32)
Related Items
Nullifying randomness and genericity using symmetric difference ⋮ Reducibilities relating to Schnorr randomness ⋮ Cupping with random sets ⋮ Randomness notions and partial relativization ⋮ STRONG JUMP-TRACEABILITY ⋮ Propagation of partial randomness ⋮ Universal computably enumerable sets and initial segment prefix-free complexity ⋮ $$\textit{K}$$-trivial, $$\textit{K}$$-low and $${{\mathrm{\textit{MLR}}}}$$-low Sequences: A Tutorial ⋮ Characterizing strong randomness via Martin-Löf randomness ⋮ Effectively approximating measurable sets by open sets ⋮ Computing from projections of random points ⋮ Oscillation in the initial segment complexity of random reals ⋮ Elementary differences between the degrees of unsolvability and degrees of compressibility ⋮ A measure-theoretic proof of Turing incomparability ⋮ \(\Pi_1^0 \) classes, LR degrees and Turing degrees ⋮ Lowness for effective Hausdorff dimension ⋮ Algorithmic randomness, reverse mathematics, and the dominated convergence theorem ⋮ Kolmogorov complexity of initial segments of sequences and arithmetical definability ⋮ COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS ⋮ Unnamed Item ⋮ Difference randomness ⋮ BEING LOW ALONG A SEQUENCE AND ELSEWHERE ⋮ Tracing and domination in the Turing degrees ⋮ Randomness and lowness notions via open covers ⋮ Mass problems associated with effectively closed sets ⋮ Unified characterizations of lowness properties via Kolmogorov complexity ⋮ Schnorr triviality and its equivalent notions
