Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension

DOI10.1145/3201783MaRDI QIDQ4973875zbMATH OpenOpenAlexFDO

Authors Jack H. Lutz, Neil Lutz

Publication date 6 December 2019

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

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2017/6980/

zbMATH Keywords

effective dimensionKakeya setsKolmogorov complexity

Mathematics Subject Classification ID

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

Recommendations

• Algorithmic information, plane Kakeya sets, and conditional dimension
• STACS 2004
• Effective Strong Dimension in Algorithmic Information and Computational Complexity
• scientific article; zbMATH DE number 5066582
• Probabilistic algorithm for computing the dimension of real algebraic sets
• scientific article; zbMATH DE number 679806
• scientific article; zbMATH DE number 922628
• Information vs. Dimension: An Algorithmic Perspective
• Algorithmic dimension of lattices
• scientific article; zbMATH DE number 4212019

Cited in

(23)

• Conditional dimension in metric spaces: a natural metric-space counterpart of Kolmogorov-complexity-based mutual dimension
• Who asked us? How the theory of computing answers questions about analysis
• Algorithmic information, plane Kakeya sets, and conditional dimension
• scientific article; zbMATH DE number 7378388 (Why is no real title available?)
• Algorithmic Fractal Dimensions in Geometric Measure Theory
• The Intersection of Algorithmically Random Closed Sets and Effective Dimension
• Dimension spectra of lines
• scientific article; zbMATH DE number 7576618 (Why is no real title available?)
• Combinatorial proofs of two theorems of Lutz and Stull
• Extending the reach of the point-to-set principle
• Dimension and the structure of complexity classes
• Projection theorems using effective dimension
• SOME CONSEQUENCES OF AND
• Inequalities for entropies and dimensions
• The point-to-set principle and the dimensions of Hamel bases
• Algorithmically optimal outer measures
• A point to set principle for finite-state dimension
• Distance sets bounds for polyhedral norms via effective dimension
• Some more results on relativized Chaitin's
• Bounds on the dimension of lineal extensions
• On the packing dimension of unions and extensions of k-planes
• Algorithmic dimensions via learning functions
• Point-to-set principle and constructive dimension faithfulness

This page was built for publication: Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension

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