Connectivity properties of dimension level sets

DOI10.1002/malq.200710060zbMath1155.03044OpenAlexW2010424305MaRDI QIDQ3528144

Weihrauch, Klaus, Jack H. Lutz

Publication date: 8 October 2008

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.200710060

zbMATH Keywords

Kolmogorov complexitycomputable analysisconstructive dimensiondimension level sets

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (7)

Dimension spectra of lines1 ⋮ Functions that preserve p-randomness ⋮ Bounding the dimension of points on a line ⋮ Completeness, Compactness, Effective Dimensions ⋮ Connectedness properties of dimension level sets ⋮ Mutual Dimension ⋮ Algorithmic Fractal Dimensions in Geometric Measure Theory

Cites Work

• Unnamed Item
• Unnamed Item
• Hausdorff dimension in probability theory. I, II
• Correspondence principles for effective dimensions
• Random elements in effective topological spaces with measure.
• Billingsley dimension in probability spaces
• A Kolmogorov complexity characterization of constructive Hausdorff dimension.
• The dimensions of individual strings and sequences
• Effective Strong Dimension in Algorithmic Information and Computational Complexity
• Dimensions of Points in Self-similar Fractals
• Von Mises' definition of random sequences reconsidered
• Dimensions and Measures of Quasi Self-Similar Sets
• The arithmetical complexity of dimension and randomness

This page was built for publication: Connectivity properties of dimension level sets