scientific article; zbMATH DE number 841084

MaRDI QIDQ4863240zbMATH OpenFDO

Authors Carl G. jun. Jockusch, Michael Stob, Rodney G. Downey

Publication date 4 November 1996

zbMATH Keywords

array nonrecursive setsgenericityrecursive enumerable degreerecursively enumerable sets

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• Array nonrecursiveness and relative recursive enumerability
• The distribution of the generic recursively enumerable degrees
• Domination, forcing, array nonrecursiveness and relative recursive enumerability
• scientific article; zbMATH DE number 4172959
• Array nonrecursive degrees and lattice embeddings of the diamond

Cited in

(30)

• Dynamic notions of genericity and array noncomputability
• Abstract complexity theory and the \(\Delta_{2}^{0}\) degrees
• Separating weak -change and -change genericity
• Integer valued betting strategies and Turing degrees
• Small \(\Pi^{0}_{1}\) classes
• Automorphisms of the lattice of _1⁰ classes; perfect thin classes and anc degrees
• Measure and cupping in the Turing degrees
• Low level nondefinability results: domination and recursive enumeration
• Bounded randomness
• Three theorems on n-REA degrees: proof-readers and verifiers
• A note on the join property
• scientific article; zbMATH DE number 4172959 (Why is no real title available?)
• Hierarchy of Computably Enumerable Degrees II
• 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
• 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 -c.e. and array computable degrees
• Kobayashi compressibility
• Array nonrecursiveness and relative recursive enumerability
• Domination, forcing, array nonrecursiveness and relative recursive enumerability
• Cupping and jump classes in the computably enumerable degrees
• Extending CL-reducibility on array noncomputable degrees
• 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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4863240)