The following pages link to (Q4779154):
Displaying 22 items.
- Oscillation in the initial segment complexity of random reals (Q633597) (← links)
- Maximal pairs of c.e. reals in the computably Lipschitz degrees (Q638499) (← links)
- Randomness and the linear degrees of computability (Q866567) (← links)
- Undecidability of the structure of the Solovay degrees of c.e. reals (Q881596) (← links)
- Non-low\(_2\)-ness and computable Lipschitz reducibility (Q1682262) (← links)
- Strong reductions in effective randomness (Q1758164) (← links)
- Coherence of reducibilities with randomness notions (Q1787952) (← links)
- Randomness and reducibility (Q1878680) (← links)
- Maximal pairs of computably enumerable sets in the computably Lipschitz degrees (Q1946505) (← links)
- Factoring Solovay-random extensions, with application to the reduction property (Q2220386) (← links)
- Where join preservation fails in the bounded Turing degrees of c.e. sets (Q2407100) (← links)
- The ibT degrees of computably enumerable sets are not dense (Q2498899) (← links)
- Randomness, computability, and density (Q2784497) (← links)
- Algorithmic randomness and measures of complexity (Q2870106) (← links)
- On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets (Q2970980) (← links)
- On initial segment complexity and degrees of randomness (Q3506714) (← links)
- The approximation structure of a computably approximable real (Q4650263) (← links)
- Computing and Combinatorics (Q4681196) (← links)
- Trivial Reals (Q4916182) (← links)
- Reducing Randomness via Irrational Numbers (Q4943867) (← links)
- Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees (Q5189151) (← links)
- Random Oracle Reducibility (Q5199182) (← links)
