Pages that link to "Item:Q1853096"

The following pages link to A Kolmogorov complexity characterization of constructive Hausdorff dimension. (Q1853096):

Displaying 50 items.

• Dimension spectra of random subfractals of self-similar fractals (Q400423) (← links)
• Strict process machine complexity (Q403400) (← links)
• Fractal dimension versus process complexity (Q504699) (← links)
• Connectedness properties of dimension level sets (Q551185) (← links)
• Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension (Q610681) (← links)
• A divergence formula for randomness and dimension (Q616503) (← links)
• Extracting Kolmogorov complexity with applications to dimension zero-one laws (Q716318) (← links)
• Constructive dimension and Turing degrees (Q733739) (← links)
• Depth as randomness deficiency (Q733740) (← links)
• Constructive dimension equals Kolmogorov complexity (Q835015) (← links)
• Algorithmically independent sequences (Q964004) (← links)
• Kolmogorov-Loveland stochasticity and Kolmogorov complexity (Q968271) (← links)
• Information measures for infinite sequences (Q974755) (← links)
• Turing degrees of reals of positive effective packing dimension (Q975475) (← links)
• Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences (Q987377) (← links)
• Pushdown dimension (Q995564) (← links)
• Scaled dimension and the Kolmogorov complexity of Turing-hard sets (Q1015370) (← links)
• Dimension extractors and optimal decompression (Q1015378) (← links)
• Effective symbolic dynamics, random points, statistical behavior, complexity and entropy (Q1049402) (← links)
• Exact constructive and computable dimensions (Q1694005) (← links)
• Computability theory. Abstracts from the workshop held January 7--13, 2018 (Q1731969) (← links)
• Nonlinear dynamics of two-dimensional cardiac action potential duration mapping model with memory (Q1741544) (← links)
• Bounded Turing reductions and data processing inequalities for sequences (Q1787951) (← links)
• Randomness and reducibility (Q1878680) (← links)
• The dimensions of individual strings and sequences (Q1887139) (← links)
• Compressibility and Kolmogorov complexity (Q1934957) (← links)
• Dimension is compression (Q1946504) (← links)
• Dimension spectra of lines (Q2011669) (← links)
• KL-randomness and effective dimension under strong reducibility (Q2117810) (← links)
• Bounding the dimension of points on a line (Q2216115) (← links)
• Monotonous betting strategies in warped casinos (Q2304524) (← links)
• Dimension, entropy rates, and compression (Q2495412) (← links)
• Kolmogorov-Loveland randomness and stochasticity (Q2576945) (← links)
• Automatic Kolmogorov complexity, normality, and finite-state dimension revisited (Q2656172) (← links)
• The Kučera-Gács theorem revisited by Levin (Q2682931) (← links)
• Mutual Dimension (Q2832303) (← links)
• Randomness, Computation and Mathematics (Q2904405) (← links)
• On zeros of Martin-Löf random Brownian motion (Q2941095) (← links)
• Relative Kolmogorov complexity and geometry (Q3107351) (← links)
• Partial Randomness and Dimension of Recursively Enumerable Reals (Q3182966) (← links)
• Who Asked Us? How the Theory of Computing Answers Questions about Analysis (Q3297823) (← links)
• Algorithmic information theory and its statistical mechanical interpretation (Q3298318) (← links)
• Randomness and Computability: Open Questions (Q3412462) (← links)
• Calibrating Randomness (Q3412463) (← links)
• Connectivity properties of dimension level sets (Q3528144) (← links)
• Algorithmically Independent Sequences (Q3533009) (← links)
• A Divergence Formula for Randomness and Dimension (Q3576066) (← links)
• AVOIDING EFFECTIVE PACKING DIMENSION 1 BELOW ARRAY NONCOMPUTABLE C.E. DEGREES (Q4579816) (← links)
• Randomness and Solovay degrees (Q4638260) (← links)
• Connectivity Properties of Dimension Level Sets (Q4918044) (← links)