Degrees in Which the Recursive Sets are Uniformly Recursive
From MaRDI portal
Publication:5625139
DOI10.4153/CJM-1972-113-9zbMath0221.02029MaRDI QIDQ5625139
Publication date: 1972
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Related Items (44)
Abstract complexity theory and the \(\Delta_{2}^{0}\) degrees ⋮ Two theorems on degrees of models of true arithmetic ⋮ Learning Families of Closed Sets in Matroids ⋮ Upper bounds for the arithmetical degrees ⋮ Weakly useful sequences ⋮ Spectrum of the field of computable real numbers ⋮ A cohesive set which is not high ⋮ Numberings, c.e. oracles, and fixed points ⋮ Minimal generalized computable numberings and families of positive preorders ⋮ Extremal numberings and fixed point theorems ⋮ MAXIMAL TOWERS AND ULTRAFILTER BASES IN COMPUTABILITY THEORY ⋮ Automorphisms ofη-like computable linear orderings and Kierstead's conjecture ⋮ Degree theoretic definitions of the low2 recursively enumerable sets ⋮ Families of permutations and ideals of Turing degrees ⋮ Embedding of the first nonconstructive ordinal into the Rogers semilattices of families of arithmetic sets ⋮ Controlling iterated jumps of solutions to combinatorial problems ⋮ Reducibility on families ⋮ Universal generalized computable numberings and hyperimmunity ⋮ Automorphism bases for degrees of unsolvability ⋮ Learning how to separate. ⋮ Avoiding uniformity in the \(\Delta_2^0\) enumeration degrees ⋮ Degree spectra of real closed fields ⋮ Generic Muchnik reducibility and presentations of fields ⋮ Computable analogs of cardinal characteristics: prediction and rearrangement ⋮ A characterization of the 0-basis homogeneous bounding degrees ⋮ Robust learning with infinite additional information ⋮ Weakly useful sequences ⋮ Equivalences between learning of data and probability distributions, and their applications ⋮ Embeddings of \(N_5\) and the contiguous degrees ⋮ Asymptotic density and the coarse computability bound ⋮ Degree spectra of structures ⋮ Khutoretskii's theorem for generalized computable families ⋮ Recursively enumerable sets and degrees ⋮ T-Degrees, Jump Classes, and Strong Reducibilities ⋮ European Summer Meeting of the Association for Symbolic Logic, Leeds, 1979 ⋮ A Completely Mitotic Nonrecursive R.E. Degree ⋮ Degrees joining to 0′ ⋮ The upper semilattice of degrees ≤ 0′ is complemented ⋮ Wtt-degrees and T-degrees of r.e. sets ⋮ Degrees of sets having no subsets of higher m- and t t-degree ⋮ Strong reducibilities ⋮ Splitting theorems in recursion theory ⋮ Classes bounded by incomplete sets ⋮ Extremes in the degrees of inferability
This page was built for publication: Degrees in Which the Recursive Sets are Uniformly Recursive
