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