An extension of the recursively enumerable Turing degrees
From MaRDI portal
Publication:5294136
DOI10.1112/jlms/jdl015zbMath1119.03037MaRDI QIDQ5294136
Publication date: 23 July 2007
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/jlms/jdl015
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
03D25: Recursively (computably) enumerable sets and degrees
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
DEEP CLASSES, Medvedev degrees of two-dimensional subshifts of finite type, Randomness and degree theory for infinite time register machines1, Effectively closed mass problems and intuitionism, Coding true arithmetic in the Medvedev degrees of \(\Pi^0_1\) classes, The weakness of being cohesive, thin or free in reverse mathematics, Mass problems associated with effectively closed sets, Embedding \(\mathrm{FD}(\omega)\) into \({\mathcal{P}_s}\) densely, The upward closure of a perfect thin class, Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions, Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism, The \(\forall \exists \)-theory of the effectively closed Medvedev degrees is decidable, Diagonally Non-Computable Functions and Bi-Immunity, A Survey of Mučnik and Medvedev Degrees, MASS PROBLEMS AND INITIAL SEGMENT COMPLEXITY, Turing Degrees and Muchnik Degrees of Recursively Bounded DNR Functions, On the degree spectrum of a $\Pi ^0_1$ class, Degrees of Unsolvability: A Tutorial, MASS PROBLEMS AND HYPERARITHMETICITY, Numberings and Randomness, Immunity for Closed Sets, Mass Problems and Measure-Theoretic Regularity
