scientific article
From MaRDI portal
Publication:3919704
zbMath0467.03046MaRDI QIDQ3919704
Richard L. Epstein, Richard Haas, Richard L. Kramer
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Other degrees and reducibilities in computability and recursion theory (03D30) Hierarchies of computability and definability (03D55)
Related Items
Abstract complexity theory and the \(\Delta_{2}^{0}\) degrees ⋮ Degree spectra of relations on structures of finite computable dimension ⋮ The Hausdorff-Ershov hierarchy in Euclidean spaces ⋮ Hierarchy of limiting computations ⋮ There exists a maximal 3-c.e. enumeration degree ⋮ Ershov hierarchy and the T-jump ⋮ Interpolating \(d\)-r.e. and REA degrees between r.e. degrees ⋮ Revision programming ⋮ Turing reducibility in the fine hierarchy ⋮ Towards characterizing the \(> \omega^2\)-fickle recursively enumerable Turing degrees ⋮ Hierarchies of function classes defined by the first-value operator ⋮ Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures ⋮ The d.r.e. degrees are not dense ⋮ Fine hierarchies and m-reducibilities in theoretical computer science ⋮ Degree Spectra of Relations on a Cone ⋮ Weak density and cupping in the d-r.e. degrees ⋮ Function operators spanning the arithmetical and the polynomial hierarchy ⋮ Precomplete numberings ⋮ Turing degrees of certain isomorphic images of computable relations ⋮ On the finiteness of the recursive chromatic number ⋮ ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES ⋮ A conjecture of Ershov for a relative hierarchy fails near \({\mathcal O}\) ⋮ Maximality and collapse in the hierarchy of α-c.a. degrees ⋮ Extremes in the degrees of inferability
