The following pages link to (Q4863240):
Displayed 27 items.
- Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers (Q342726) (← links)
- 2-minimality, jump classes and a note on natural definability (Q386644) (← links)
- Kobayashi compressibility (Q528498) (← links)
- A uniform version of non-\(\mathrm{low}_{2}\)-ness (Q730092) (← links)
- Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega (Q736609) (← links)
- Tracing and domination in the Turing degrees (Q764269) (← links)
- Turing degrees of reals of positive effective packing dimension (Q975475) (← links)
- Dynamic notions of genericity and array noncomputability (Q1295423) (← links)
- Abstract complexity theory and the \(\Delta_{2}^{0}\) degrees (Q1612486) (← links)
- Separating weak \(\alpha\)-change and \(\alpha\)-change genericity (Q2140582) (← links)
- Integer valued betting strategies and Turing degrees (Q2353410) (← links)
- Small \(\Pi^{0}_{1}\) classes (Q2491076) (← links)
- Automorphisms of the lattice of $\Pi _1^0$ classes; perfect thin classes and anc degrees (Q2750927) (← links)
- Measure and cupping in the Turing degrees (Q2845877) (← links)
- Low Level Nondelegability Results: Domination and Recursive Enumeration (Q2869914) (← links)
- Bounded Randomness (Q2891302) (← links)
- Three Theorems on n-REA Degrees: Proof-Readers and Verifiers (Q3091436) (← links)
- A note on the join property (Q3116561) (← links)
- Hierarchy of Computably Enumerable Degrees II (Q3380356) (← links)
- AVOIDING EFFECTIVE PACKING DIMENSION 1 BELOW ARRAY NONCOMPUTABLE C.E. DEGREES (Q4579816) (← links)
- STRONG JUMP-TRACEABILITY (Q4580033) (← links)
- A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES (Q4637942) (← links)
- Trivial Reals (Q4916182) (← links)
- Nonlowness is independent from fickleness (Q5037206) (← links)
- Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees (Q5189151) (← links)
- Array nonrecursiveness and relative recursive enumerability (Q5388716) (← links)
- CUPPING AND JUMP CLASSES IN THE COMPUTABLY ENUMERABLE DEGREES (Q5858920) (← links)