Dimension spectra of lines1

DOI10.3233/COM-190292MaRDI QIDQ5075516

Neil Lutz, D. M. Stull

Publication date: 16 May 2022

Published in: Computability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/com-190292

zbMATH Keywords

Kolmogorov complexity; effective dimension

Mathematics Subject Classification ID

68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)

28A78: Hausdorff and packing measures

03D32: Algorithmic randomness and dimension

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dimension spectra of random subfractals of self-similar fractals
• Connectedness properties of dimension level sets
• Correspondence principles for effective dimensions
• Effectively closed sets of measures and randomness
• Mutual dimension and random sequences
• A Kolmogorov complexity characterization of constructive Hausdorff dimension.
• The dimensions of individual strings and sequences
• Bounding the dimension of points on a line
• Mathematical foundations of computer science 2015. 40th international symposium, MFCS 2015, Milan, Italy, August 24--28, 2015. Proceedings. Part II
• Mutual Dimension
• Furstenberg sets for a fractal set of directions
• Algorithmic Randomness and Complexity
• Lines missing every random point1
• Effective Strong Dimension in Algorithmic Information and Computational Complexity
• Connectivity properties of dimension level sets
• Dimensions of Points in Self-Similar Fractals
• Dimension in Complexity Classes
• Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension
• Refined Size Estimates for Furstenberg Sets via Hausdorff Measures: A Survey of Some Recent Results
• Translating the Cantor set by a random real
• Elements of Information Theory
• On the Length of Programs for Computing Finite Binary Sequences
• On the Length of Programs for Computing Finite Binary Sequences
• A formal theory of inductive inference. Part II
• An introduction to Kolmogorov complexity and its applications
• Some connections between Falconer's distance set conjecture and sets of Furstenburg type