Lowness and nullsets

DOI10.2178/jsl/1154698590zbMath1112.03040OpenAlexW2029712093MaRDI QIDQ3410688

Liang Yu, André Nies, Rebecca Weber, Rodney G. Downey

Publication date: 29 November 2006

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

Full work available at URL: https://doi.org/10.2178/jsl/1154698590

zbMATH Keywords

lowness2-randomness

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of computability and recursion theory (03D80) Recursively (computably) enumerable sets and degrees (03D25)

Related Items (20)

Initial segment complexities of randomness notions ⋮ A Computational Approach to the Borwein-Ditor Theorem ⋮ RELATIONSHIPS BETWEEN COMPUTABILITY-THEORETIC PROPERTIES OF PROBLEMS ⋮ Defining a randomness notion via another ⋮ USING ALMOST-EVERYWHERE THEOREMS FROM ANALYSIS TO STUDY RANDOMNESS ⋮ Continuous randomness via transformations of 2-random sequences ⋮ Characterizing strong randomness via Martin-Löf randomness ⋮ HIGHER RANDOMNESS AND GENERICITY ⋮ DENSITY-1-BOUNDING AND QUASIMINIMALITY IN THE GENERIC DEGREES ⋮ Lowness, Randomness, and Computable Analysis ⋮ WEAKLY 2-RANDOMS AND 1-GENERICS IN SCOTT SETS ⋮ Strong jump-traceability. I: The computably enumerable case ⋮ RECOGNIZING STRONG RANDOM REALS ⋮ Unnamed Item ⋮ Difference randomness ⋮ Randomness and lowness notions via open covers ⋮ Randomness and Computability: Open Questions ⋮ Unified characterizations of lowness properties via Kolmogorov complexity ⋮ Effective randomness for continuous measures ⋮ Trivial measures are not so trivial

Cites Work

• On Kurtz randomness
• Algorithmic Randomness and Complexity
• Every sequence is reducible to a random one
• Lowness for the class of random sets
• Degrees of Unsolvability. (AM-55)
• The definition of random sequences

This page was built for publication: Lowness and nullsets