Mass problems and almost everywhere domination
From MaRDI portal
Publication:5307613
DOI10.1002/malq.200710013zbMath1123.03041MaRDI 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
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
03D80: Applications of computability and recursion theory
03D25: Recursively (computably) enumerable sets and degrees
03D30: Other degrees and reducibilities in computability and recursion theory
03D28: Other Turing degree structures
Related Items
Medvedev degrees of two-dimensional subshifts of finite type, Demuth randomness and computational complexity, Mass problems associated with effectively closed sets, Embedding \(\mathrm{FD}(\omega)\) into \({\mathcal{P}_s}\) densely, Benign cost functions and lowness properties, Degrees of Unsolvability: A Tutorial, MASS PROBLEMS AND HYPERARITHMETICITY, Mass Problems and Measure-Theoretic Regularity
Cites Work