Algorithmic Fractal Dimensions in Geometric Measure Theory
From MaRDI portal
Publication:5024574
DOI10.1007/978-3-030-59234-9_8OpenAlexW3046037133MaRDI QIDQ5024574
Jack H. Lutz, Elvira Mayordomo
Publication date: 26 January 2022
Published in: Theory and Applications of Computability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.14346
Related Items
Extending the reach of the point-to-set principle ⋮ Dimension and the structure of complexity classes ⋮ Unnamed Item
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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- A polynomial-time algorithm for computing absolutely normal numbers
- Dimension spectra of random subfractals of self-similar fractals
- Curves that must be retraced
- Connectedness properties of dimension level sets
- Computing space-filling curves
- On normal numbers
- Hausdorff dimension in probability theory. I, II
- Hausdorff dimension and capacities of intersections of sets in n-space
- Rectifiable sets and the traveling salesman problem
- Correspondence principles for effective dimensions
- Entropy rates and finite-state dimension
- Resource-bounded strong dimension versus resource-bounded category
- Entropy, Hausdorff measures old and new, and limit sets of geometrically finite Kleinian groups
- Descriptive set theory
- Algorithmic approach to the prediction problem
- The complexity and effectiveness of prediction algorithms
- Space-filling curves
- On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line
- A tight upper bound on Kolmogorov complexity and uniformly optimal prediction
- Mutual dimension and random sequences
- Effective Hausdorff dimension in general metric spaces
- Noiseless coding of combinatorial sources, Hausdorff dimension, and Kolmogorov complexity
- Billingsley dimension in probability spaces
- A Kolmogorov complexity characterization of constructive Hausdorff dimension.
- Finite-state dimension
- The dimensions of individual strings and sequences
- Dimension is compression
- Dimension spectra of lines
- Computing absolutely normal numbers in nearly linear time
- Bounding the dimension of points on a line
- Kolmogorov complexity and Hausdorff dimension
- The Kolmogorov complexity of infinite words
- Base invariance of feasible dimension
- Dimension, entropy rates, and compression
- Endliche Automaten und Zufallsfolgen
- Mutual Dimension
- Fractals in Probability and Analysis
- Furstenberg sets for a fractal set of directions
- Point-Separable Classes of Simple Computable Planar Curves
- Effective fractal dimensions
- Algorithmic Randomness and Complexity
- Points on Computable Curves of Computable Lengths
- Lines missing every random point1
- On a problem of Steinhaus about normal numbers
- Connectivity properties of dimension level sets
- Effective packing dimension of $\Pi ^0_1$-classes
- Members of Random Closed Sets
- Dimensions of Points in Self-Similar Fractals
- On the Hausdorff dimension and capacities of intersections
- Two definitions of fractional dimension
- Computability of Self-Similar Sets
- Sets with Large Intersection Properties
- Dimension in Complexity Classes
- Kolmogorov Complexity and Algorithmic Randomness
- Characterization of Subsets of Rectifiable Curves in R n
- Dimensions and Measures of Quasi Self-Similar Sets
- Computing links and accessing arcs
- Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension
- Fractal Intersections and Products via Algorithmic Dimension
- The arithmetical complexity of dimension and randomness
- Translating the Cantor set by a random real
- Algorithmic Randomness of Closed Sets
- Elements of Information Theory
- [https://portal.mardi4nfdi.de/wiki/Publication:5578098 �ber den Dimensionsbegriff in Wahrscheinlichkeitsr�umen von P. Billingsley. I]
- The definition of random sequences
- Some Fundamental Geometrical Properties of Plane Sets of Fractional Dimensions
- An introduction to Kolmogorov complexity and its applications
- Some connections between Falconer's distance set conjecture and sets of Furstenburg type
- Logical operations and Kolmogorov complexity
