Lowness for the Class of Schnorr Random Reals
From MaRDI portal
Publication:5470706
DOI10.1137/S0097539704446323zbMath1095.68043arXiv1408.2893OpenAlexW3100156515MaRDI QIDQ5470706
André Nies, Bjørn Kjos-Hanssen, Frank Stephan
Publication date: 1 June 2006
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.2893
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28)
Related Items (29)
Reducibilities relating to Schnorr randomness ⋮ On Kurtz randomness ⋮ Low for random reals and positive-measure domination ⋮ CHARACTERIZING LOWNESS FOR DEMUTH RANDOMNESS ⋮ Defining a randomness notion via another ⋮ Covering the Recursive Sets ⋮ Strong jump-traceability. II: \(K\)-triviality ⋮ STRONG JUMP-TRACEABILITY ⋮ Natural factors of the Muchnik lattice capturing IPC ⋮ Schnorr randomness for noncomputable measures ⋮ A \(K\)-trivial set which is not jump traceable at certain orders ⋮ Lowness for difference tests ⋮ Schnorr trivial reals: a construction ⋮ Truth-table Schnorr randomness and truth-table reducible randomness ⋮ Lowness of higher randomness notions ⋮ Covering the recursive sets ⋮ Strong jump-traceability. I: The computably enumerable case ⋮ Lowness for Demuth Randomness ⋮ Schnorr Trivial Reals: A construction ⋮ Lowness for integer-valued randomness ⋮ Hyperimmune-free degrees and Schnorr triviality ⋮ 𝐾-trivial degrees and the jump-traceability hierarchy ⋮ Lowness for Kurtz randomness ⋮ Highness properties close to PA completeness ⋮ Kolmogorov complexity and the Recursion Theorem ⋮ Randomness and lowness notions via open covers ⋮ Lowness properties and randomness ⋮ Unified characterizations of lowness properties via Kolmogorov complexity ⋮ Schnorr triviality and its equivalent notions
This page was built for publication: Lowness for the Class of Schnorr Random Reals
