Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension

DOI10.1145/3201783zbMath1427.68132OpenAlexW2962852467MaRDI QIDQ4973875

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

Kolmogorov complexityeffective dimensionKakeya sets

Mathematics Subject Classification ID

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

Related Items (13)

The Intersection of Algorithmically Random Closed Sets and Effective Dimension ⋮ Dimension spectra of lines1 ⋮ 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 ⋮ Unnamed Item ⋮ Bounding the dimension of points on a line ⋮ Who Asked Us? How the Theory of Computing Answers Questions about Analysis ⋮ Combinatorial proofs of two theorems of Lutz and Stull ⋮ Unnamed Item ⋮ Algorithmic Fractal Dimensions in Geometric Measure Theory

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