Mass problems and almost everywhere domination
From MaRDI portal
Publication:5307613
DOI10.1002/malq.200710013zbMath1123.03041OpenAlexW2081181073MaRDI QIDQ5307613
Publication date: 17 September 2007
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.200710013
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of computability and recursion theory (03D80) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Other Turing degree structures (03D28)
Related Items
Degrees of Unsolvability: A Tutorial ⋮ Continuous randomness via transformations of 2-random sequences ⋮ MASS PROBLEMS AND HYPERARITHMETICITY ⋮ Demuth randomness and computational complexity ⋮ Embedding \(\mathrm{FD}(\omega)\) into \({\mathcal{P}_s}\) densely ⋮ Medvedev degrees of two-dimensional subshifts of finite type ⋮ Benign cost functions and lowness properties ⋮ Mass problems associated with effectively closed sets ⋮ Mass Problems and Measure-Theoretic Regularity
Cites Work
This page was built for publication: Mass problems and almost everywhere domination