Jump inversions inside effectively closed sets and applications to randomness
From MaRDI portal
Publication:3011117
DOI10.2178/jsl/1305810761zbMath1248.03065OpenAlexW2085389411MaRDI QIDQ3011117
Keng Meng Ng, George Barmpalias, Rodney G. Downey
Publication date: 28 June 2011
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2178/jsl/1305810761
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Other Turing degree structures (03D28) Algorithmic randomness and dimension (03D32)
Related Items (7)
Higher randomness and forcing with closed sets ⋮ Optimal redundancy in computations from random oracles ⋮ RANDOMNESS NOTIONS AND REVERSE MATHEMATICS ⋮ ON THE INTERPLAY BETWEEN EFFECTIVE NOTIONS OF RANDOMNESS AND GENERICITY ⋮ Measure and cupping in the Turing degrees ⋮ Unified characterizations of lowness properties via Kolmogorov complexity ⋮ Integer valued betting strategies and Turing degrees
Cites Work
- Unnamed Item
- Kolmogorov-Loveland randomness and stochasticity
- On degrees of unsolvability
- Algorithmic Randomness and Complexity
- Randomness and Computability: Open Questions
- When van Lambalgen’s Theorem fails
- The upper semilattice of degrees ≤ 0′ is complemented
- Every sequence is reducible to a random one
- Minimal degrees and the jump operator
- A cohesive set which is not high
- Decidability of the “almost all” theory of degrees
- Degrees of Unsolvability. (AM-55)
- Classes of Recursively Enumerable Sets and Degrees of Unsolvability
- Class groups of integral group rings
- A basis theorem for Π₁⁰ classes of positive measure and jump inversion for random reals
This page was built for publication: Jump inversions inside effectively closed sets and applications to randomness