Mutual Dimension
From MaRDI portal
Publication:2832303
DOI10.1145/2786566zbMath1348.03041arXiv1410.4135OpenAlexW2336690199MaRDI QIDQ2832303
Publication date: 10 November 2016
Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1410.4135
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32) Computation over the reals, computable analysis (03D78)
Related Items (8)
Mutual dimension and random sequences ⋮ Dimension spectra of lines1 ⋮ Projection theorems using effective dimension ⋮ Unnamed Item ⋮ Bounding the dimension of points on a line ⋮ Fractal Intersections and Products via Algorithmic Dimension ⋮ Bounded Turing reductions and data processing inequalities for sequences ⋮ Algorithmic Fractal Dimensions in Geometric Measure Theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Curves that must be retraced
- Connectedness properties of dimension level sets
- Computing space-filling curves
- Correspondence principles for effective dimensions
- Effective dimension of points visited by Brownian motion
- Inequalities for Shannon entropy and Kolmogorov complexity
- A Kolmogorov complexity characterization of constructive Hausdorff dimension.
- The dimensions of individual strings and sequences
- Curves That Must Be Retraced
- Points on Computable Curves of Computable Lengths
- Effective Strong Dimension in Algorithmic Information and Computational Complexity
- Connectivity properties of dimension level sets
- Dimensions of Points in Self-Similar Fractals
- Translating the Cantor set by a random real
- Elements of Information Theory
- Mutual Information and Maximal Correlation as Measures of Dependence
- On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
- An introduction to Kolmogorov complexity and its applications
- Logical operations and Kolmogorov complexity
This page was built for publication: Mutual Dimension
