Publication:4863240
From MaRDI portal
zbMath0849.03029MaRDI QIDQ4863240
Michael Stob, Carl G. jun. Jockusch, Rodney G. Downey
Publication date: 4 November 1996
03D25: Recursively (computably) enumerable sets and degrees
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
AVOIDING EFFECTIVE PACKING DIMENSION 1 BELOW ARRAY NONCOMPUTABLE C.E. DEGREES, STRONG JUMP-TRACEABILITY, A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES, Trivial Reals, Nonlowness is independent from fickleness, Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees, Array nonrecursiveness and relative recursive enumerability, CUPPING AND JUMP CLASSES IN THE COMPUTABLY ENUMERABLE DEGREES, Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers, 2-minimality, jump classes and a note on natural definability, Kobayashi compressibility, A uniform version of non-\(\mathrm{low}_{2}\)-ness, Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega, Tracing and domination in the Turing degrees, Turing degrees of reals of positive effective packing dimension, Dynamic notions of genericity and array noncomputability, Abstract complexity theory and the \(\Delta_{2}^{0}\) degrees, Separating weak \(\alpha\)-change and \(\alpha\)-change genericity, Integer valued betting strategies and Turing degrees, Small \(\Pi^{0}_{1}\) classes, Automorphisms of the lattice of $\Pi _1^0$ classes; perfect thin classes and anc degrees, Measure and cupping in the Turing degrees, Low Level Nondelegability Results: Domination and Recursive Enumeration, Bounded Randomness, Three Theorems on n-REA Degrees: Proof-Readers and Verifiers, A note on the join property, Hierarchy of Computably Enumerable Degrees II
