Lowness for Kurtz randomness

DOI10.2178/jsl/1243948333zbMath1168.03033OpenAlexW2056209122MaRDI QIDQ3630585

Noam Greenberg, Joseph S. Miller

Publication date: 4 June 2009

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

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.497.7202

zbMATH Keywords

lownessKurtz randomnessdiagonally nonrecursivesvelte tree

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of computability and recursion theory (03D80) Other Turing degree structures (03D28)

Related Items

CHARACTERIZING LOWNESS FOR DEMUTH RANDOMNESS ⋮ Defining a randomness notion via another ⋮ Randomness notions and partial relativization ⋮ OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS ⋮ DEEP CLASSES ⋮ Ramsey-type graph coloring and diagonal non-computability ⋮ HIGHER RANDOMNESS AND GENERICITY ⋮ Higher Kurtz randomness ⋮ Effective Bi-immunity and Randomness ⋮ On the logical strengths of partial solutions to mathematical problems ⋮ The weakness of being cohesive, thin or free in reverse mathematics ⋮ Members of Random Closed Sets ⋮ Lowness for Demuth Randomness ⋮ Kolmogorov complexity and the Recursion Theorem ⋮ A STRONG LAW OF COMPUTATIONALLY WEAK SUBSETS ⋮ Randomness and lowness notions via open covers ⋮ Martin-Löf randomness and Galton-Watson processes ⋮ Unified characterizations of lowness properties via Kolmogorov complexity

Cites Work

• Unnamed Item
• On degrees of recursive unsolvability
• Lowness for genericity
• On Kurtz randomness
• Lowness properties and randomness
• Computational randomness and lowness
• Calibrating Randomness
• MASS PROBLEMS AND HYPERARITHMETICITY
• Lowness for the Class of Schnorr Random Reals
• Randomness, relativization and Turing degrees