Computational randomness and lowness

DOI10.2307/2695101zbMath0990.03033OpenAlexW2158555299MaRDI QIDQ2758053

Sebastiaan A. Terwijn, Domenico Zambella

Publication date: 25 July 2002

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

Full work available at URL: https://doi.org/10.2307/2695101

zbMATH Keywords

Schnorr randomnesslow setsMartin Löf randomness

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items (46)

Lowness for genericity ⋮ 2009–2010 Winter Meeting of the Association for Symbolic Logic ⋮ Reducibilities relating to Schnorr randomness ⋮ On Kurtz randomness ⋮ Asymptotic density, computable traceability, and 1-randomness ⋮ Low for random reals and positive-measure domination ⋮ Schnorr randomness ⋮ RELATIONSHIPS BETWEEN COMPUTABILITY-THEORETIC PROPERTIES OF PROBLEMS ⋮ Strong jump-traceability. II: \(K\)-triviality ⋮ Randomness notions and partial relativization ⋮ STRONG JUMP-TRACEABILITY ⋮ Natural factors of the Muchnik lattice capturing IPC ⋮ SOME CONSEQUENCES OF AND ⋮ Lowness for isomorphism, countable ideals, and computable traceability ⋮ Higher Kurtz randomness ⋮ A \(K\)-trivial set which is not jump traceable at certain orders ⋮ Asymptotic Density and the Theory of Computability: A Partial Survey ⋮ Lowness, Randomness, and Computable Analysis ⋮ Lowness for difference tests ⋮ On strongly jump traceable reals ⋮ Schnorr trivial reals: a construction ⋮ Lowness of higher randomness notions ⋮ Covering the recursive sets ⋮ Randomness, relativization and Turing degrees ⋮ Strong jump-traceability. I: The computably enumerable case ⋮ Trivial Reals ⋮ Lowness properties and approximations of the jump ⋮ Lowness for Demuth Randomness ⋮ Schnorr Trivial Reals: A construction ⋮ Computable analogs of cardinal characteristics: prediction and rearrangement ⋮ Lowness Properties of Reals and Hyper-Immunity ⋮ Turing degrees of reals of positive effective packing dimension ⋮ Relativized Schnorr tests with universal behavior ⋮ Hyperimmune-free degrees and Schnorr triviality ⋮ Benign cost functions and lowness properties ⋮ 𝐾-trivial degrees and the jump-traceability hierarchy ⋮ Lowness for Kurtz randomness ⋮ Tracing and domination in the Turing degrees ⋮ Randomness and lowness notions via open covers ⋮ Randomness and Computability: Open Questions ⋮ Calibrating Randomness ⋮ Inherent enumerability of strong jump-traceability ⋮ Lowness properties and randomness ⋮ Unified characterizations of lowness properties via Kolmogorov complexity ⋮ Integer valued betting strategies and Turing degrees ⋮ Schnorr triviality and its equivalent notions

Cites Work

• A mathematical proof of S. Shelah's theorem on the measure problem and related results
• The Degrees of Hyperimmune Sets
• The definition of random sequences

This page was built for publication: Computational randomness and lowness