The following pages link to (Q3705346):
Displaying 22 items.
- Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension (Q610681) (← links)
- Error-correcting codes and phase transitions (Q691642) (← links)
- Constructive dimension and Turing degrees (Q733739) (← links)
- Constructive dimension equals Kolmogorov complexity (Q835015) (← links)
- Natural halting probabilities, partial randomness, and zeta functions (Q859830) (← links)
- Algorithmically independent sequences (Q964004) (← links)
- Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences (Q987377) (← links)
- Scaled dimension and the Kolmogorov complexity of Turing-hard sets (Q1015370) (← links)
- Dimension extractors and optimal decompression (Q1015378) (← links)
- Exact constructive and computable dimensions (Q1694005) (← links)
- Effective Hausdorff dimension in general metric spaces (Q1787953) (← links)
- The dimensions of individual strings and sequences (Q1887139) (← links)
- Dimension is compression (Q1946504) (← links)
- The Kolmogorov complexity of infinite words (Q2383593) (← links)
- Kolmogorov-Loveland randomness and stochasticity (Q2576945) (← links)
- The Kučera-Gács theorem revisited by Levin (Q2682931) (← links)
- A Correspondence Principle for Exact Constructive Dimension (Q2904465) (← links)
- Partial Randomness and Dimension of Recursively Enumerable Reals (Q3182966) (← links)
- Algorithmic information theory and its statistical mechanical interpretation (Q3298318) (← links)
- Algorithmically Independent Sequences (Q3533009) (← links)
- Algorithmic Fractal Dimensions in Geometric Measure Theory (Q5024574) (← links)
- Cone avoiding closed sets (Q5496642) (← links)
