Pages that link to "Item:Q610681"
From MaRDI portal
The following pages link to Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension (Q610681):
Displaying 19 items.
- Propagation of partial randomness (Q386647) (← links)
- Fractal dimension versus process complexity (Q504699) (← links)
- Randomness for computable measures and initial segment complexity (Q508835) (← links)
- Extracting Kolmogorov complexity with applications to dimension zero-one laws (Q716318) (← links)
- Mass problems associated with effectively closed sets (Q765664) (← links)
- Algorithmically independent sequences (Q964004) (← links)
- Dimension 1 sequences are close to randoms (Q1680550) (← links)
- Strong Medvedev reducibilities and the KL-randomness problem (Q2104264) (← links)
- On effectively closed sets of effective strong measure zero (Q2453070) (← links)
- Extracting randomness within a subset is hard (Q2663792) (← links)
- A real of strictly positive effective packing dimension that does not compute a real of effective packing dimension one (Q2892669) (← links)
- Randomness, Computation and Mathematics (Q2904405) (← links)
- MASS PROBLEMS AND INITIAL SEGMENT COMPLEXITY (Q2921016) (← links)
- Degrees of Unsolvability: A Tutorial (Q3195683) (← links)
- AVOIDING EFFECTIVE PACKING DIMENSION 1 BELOW ARRAY NONCOMPUTABLE C.E. DEGREES (Q4579816) (← links)
- Optimal bounds for single-source Kolmogorov extractors (Q5217889) (← links)
- Medvedev degrees of two-dimensional subshifts of finite type (Q5415947) (← links)
- Cone avoiding closed sets (Q5496642) (← links)
- Growth and irreducibility in path-incompressible trees (Q6204167) (← links)
