Algorithmic information, plane Kakeya sets, and conditional dimension

DOI10.4230/LIPICS.STACS.2017.53MaRDI QIDQ4636654zbMATH OpenFDO

Authors Jack H. Lutz, Neil Lutz

Publication date 19 April 2018

Full work available at URL https://arxiv.org/abs/1511.00442

zbMATH Keywords

algorithmic randomnessconditional dimensiongeometric measure theoryKakeya setsKolmogorov complexity

Mathematics Subject Classification ID

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

Recommendations

• Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension
• Conditional dimension in metric spaces: a natural metric-space counterpart of Kolmogorov-complexity-based mutual dimension
• On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line
• Some results in support of the Kakeya conjecture

Cited in

(10)

• Computability theory. Abstracts from the workshop held January 7--13, 2018
• Effective Hausdorff dimension in general metric spaces
• Dimension spectra of lines
• Conditional dimension in metric spaces: a natural metric-space counterpart of Kolmogorov-complexity-based mutual dimension
• Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension
• Results on the dimension spectra of planar lines
• Effective aspects of Hausdorff and Fourier dimension
• Capacitability for Co-Analytic Sets
• Fractal Intersections and Products via Algorithmic Dimension
• On a metric generalization of the \(tt\)-degrees and effective dimension theory

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 Q4636654)