Pages that link to "Item:Q733739"
From MaRDI portal
The following pages link to Constructive dimension and Turing degrees (Q733739):
Displaying 11 items.
- Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension (Q610681) (← links)
- Dimension extractors and optimal decompression (Q1015378) (← links)
- Dimension 1 sequences are close to randoms (Q1680550) (← links)
- How much randomness is needed for statistics? (Q2453071) (← links)
- Randomness extraction and asymptotic Hamming distance (Q2848372) (← links)
- A real of strictly positive effective packing dimension that does not compute a real of effective packing dimension one (Q2892669) (← links)
- The natural hierarchy and quasi-hierarchy of constructibility degrees (Q3026997) (← links)
- AVOIDING EFFECTIVE PACKING DIMENSION 1 BELOW ARRAY NONCOMPUTABLE C.E. DEGREES (Q4579816) (← links)
- (Q4694290) (← links)
- Optimal bounds for single-source Kolmogorov extractors (Q5217889) (← links)
- Logical Approaches to Computational Barriers (Q5898813) (← links)