Reals which compute little
From MaRDI portal
Recommendations
Cited in
(25)- Randomness and reducibility
- On Kurtz randomness
- Building models of strongly minimal theories
- On trees without hyperimmune branches
- Limitwise monotonic spectra and their generalizations
- On fairly low and superlow sets
- Strong jump-traceability. I: The computably enumerable case
- Lowness properties and approximations of the jump
- Lowness properties and randomness
- Hierarchy of Computably Enumerable Degrees II
- Lowness for Demuth Randomness
- 𝐾-trivial degrees and the jump-traceability hierarchy
- Computably enumerable sets below random sets
- Characterizing the strongly jump-traceable sets via randomness
- Trivial Reals
- Taking the path computably traveled
- Computable numberings of families of low sets and Turing jumps in the Ershov hierarchy
- Limit computability and ultrafilters
- A measure-theoretic proof of Turing incomparability
- Upper bounds on ideals in the computably enumerable Turing degrees
- Demuth randomness and computational complexity
- Tracing and domination in the Turing degrees
- Random non-cupping revisited
- On strongly jump traceable reals
- \(\Pi_1^0 \) classes, LR degrees and Turing degrees
This page was built for publication: Reals which compute little
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5494235)
