Low upper bounds of ideals
From MaRDI portal
Publication:3630577
DOI10.2178/jsl/1243948325zbMath1168.68021arXiv0708.3793OpenAlexW2137527449MaRDI QIDQ3630577
Theodore A. Slaman, Antonín Kučera
Publication date: 4 June 2009
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0708.3793
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Complexity of computation (including implicit computational complexity) (03D15)
Related Items (5)
The computability, definability, and proof theory of Artinian rings ⋮ COMPUTINGK-TRIVIAL SETS BY INCOMPLETE RANDOM SETS ⋮ MAXIMAL TOWERS AND ULTRAFILTER BASES IN COMPUTABILITY THEORY ⋮ choice classes ⋮ Upper bounds on ideals in the computably enumerable Turing degrees
Cites Work
- Classical recursion theory. Vol. II
- Interpolation and embedding in the recursively enumerable degrees
- Lowness properties and randomness
- Randomness and Computability: Open Questions
- Calibrating Randomness
- Reducibility orderings: Theories, definability and automorphisms
- Algorithmic Information Theory
- Using random sets as oracles
- Class groups of integral group rings
This page was built for publication: Low upper bounds of ideals
