Connectivity Properties of Dimension Level Sets

DOI10.1016/j.entcs.2008.03.022zbMath1262.03086OpenAlexW2078590039MaRDI QIDQ4918044

Weihrauch, Klaus, Jack H. Lutz

Publication date: 3 May 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.03.022

zbMATH Keywords

Kolmogorov complexitycomputabilityrandomnessconstructive dimensiondimension level set

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Connected and locally connected spaces (general aspects) (54D05) Dimension theory in general topology (54F45) Computation over the reals, computable analysis (03D78)

Related Items

Computability of probability measures and Martin-Löf randomness over metric spaces ⋮ Dimensions of Points in Self-similar Fractals

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Dimensions of Points in Self-similar Fractals
• Von Mises' definition of random sequences reconsidered
• The arithmetical complexity of dimension and randomness