Lowness of higher randomness notions

DOI10.1007/s11856-008-1019-9zbMath1153.03020OpenAlexW2021939807MaRDI QIDQ948873

Liang Yu, André Nies, Chi Tat Chong

Publication date: 16 October 2008

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11856-008-1019-9

zbMATH Keywords

Martin-Löf randomnessalgorithmic randomnessrandom realshigher recursion theory

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of computability and recursion theory (03D80) Higher-type and set recursion theory (03D65)

Related Items (10)

Higher randomness and forcing with closed sets ⋮ A New Proof of Friedman's Conjecture ⋮ LUZIN’S (N) AND RANDOMNESS REFLECTION ⋮ HIGHER RANDOMNESS AND GENERICITY ⋮ Higher Kurtz randomness ⋮ RANDOMNESS IN THE HIGHER SETTING ⋮ GENERICITY AND RANDOMNESS WITH ITTMS ⋮ Unnamed Item ⋮ Measure-theoretic applications of higher Demuth’s Theorem ⋮ Continuous higher randomness

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lowness for genericity
• Descriptive set theory
• Computational randomness and lowness
• Hyperarithmetical quantifiers
• The Theory of Countable Analytical Sets
• Measure and category in effective descriptive set theory
• Randomness via effective descriptive set theory
• Some applications of the notions of forcing and generic sets
• Computability and Randomness
• Lowness for the Class of Schnorr Random Reals
• Measure-Theoretic Uniformity in Recursion Theory and Set Theory
• Uniformization in a playful universe
• Randomness, relativization and Turing degrees
• Incompleteness along paths in progressions of theories
• Theory and Applications of Models of Computation

This page was built for publication: Lowness of higher randomness notions