Mass problems and almost everywhere domination
From MaRDI portal
Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28) Other degrees and reducibilities in computability and recursion theory (03D30) Applications of computability and recursion theory (03D80) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
Recommendations
Cites work
Cited in
(16)- Benign cost functions and lowness properties
- Degrees of unsolvability: a tutorial
- Mass Problems and Randomness
- MASS PROBLEMS AND HYPERARITHMETICITY
- Some fundamental issues concerning degrees of unsolvability
- The strength of the Besicovitch-Davies theorem
- Mass problems and measure-theoretic regularity
- Muchnik degrees and cardinal characteristics
- Almost everywhere domination and superhighness
- Almost everywhere domination
- Medvedev degrees of two-dimensional subshifts of finite type
- Theory and Applications of Models of Computation
- Continuous randomness via transformations of 2-random sequences
- Demuth randomness and computational complexity
- Mass problems associated with effectively closed sets
- Embedding \(\mathrm{FD}(\omega)\) into \({\mathcal{P}_s}\) densely
This page was built for publication: Mass problems and almost everywhere domination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5307613)