Fractal Intersections and Products via Algorithmic Dimension

DOI10.1145/3460948MaRDI QIDQ5868873zbMATH OpenOpenAlexFDO

Authors Neil Lutz

Publication date 24 September 2022

Published in ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3460948

zbMATH Keywords

effective dimensionfractal geometryKolmogorov complexity

Mathematics Subject Classification ID

Fractals (28A80) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Fractal Intersections and Products via Algorithmic Dimension
• Algorithmic Fractal Dimensions in Geometric Measure Theory
• scientific article; zbMATH DE number 1780044
• scientific article; zbMATH DE number 3927271
• Fractal dimension and measure of intersection of two Cantor sets
• Fractal dimension of the intersection of standard Cantor sets
• The fractal dimension and measure of intersection of two Cantor sets
• Large intersection classes on fractals
• An intermediate value property of fractal dimensions of Cartesian product
• Algorithmic interpretations of fractal dimension

Cited in

(11)

• Dimension and the structure of complexity classes
• The point-to-set principle and the dimensions of Hamel bases
• Extending the reach of the point-to-set principle
• Algorithmic interpretations of fractal dimension
• Algorithmic Fractal Dimensions in Geometric Measure Theory
• Algorithmic dimensions via learning functions
• Point-to-set principle and constructive dimension faithfulness
• Fractal Intersections and Products via Algorithmic Dimension
• Algorithmically optimal outer measures
• Who asked us? How the theory of computing answers questions about analysis
• Projection theorems using effective dimension

This page was built for publication: Fractal Intersections and Products via Algorithmic Dimension

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5868873)