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