Effective fractal dimensions
Algorithmic information theorycircuit-size complexitycomputational complexityconstructive dimensionentropygalesHausdorff dimensionKolmogorov complexitymartingalespacking dimensionpolynomial-time degreesrandom sequencesresource-bounded dimension
Complexity of computation (including implicit computational complexity) (03D15) Theory of numerations, effectively presented structures (03D45) Hausdorff and packing measures (28A78) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
- A generalization of Chaitin's halting probability \(\Omega\) and halting self-similar sets
- scientific article; zbMATH DE number 1670880 (Why is no real title available?)
- scientific article; zbMATH DE number 2089375 (Why is no real title available?)
- scientific article; zbMATH DE number 44693 (Why is no real title available?)
- scientific article; zbMATH DE number 1236373 (Why is no real title available?)
- scientific article; zbMATH DE number 1335897 (Why is no real title available?)
- scientific article; zbMATH DE number 1010621 (Why is no real title available?)
- scientific article; zbMATH DE number 2038717 (Why is no real title available?)
- scientific article; zbMATH DE number 1421008 (Why is no real title available?)
- scientific article; zbMATH DE number 3034028 (Why is no real title available?)
- Noiseless coding of combinatorial sources, Hausdorff dimension, and Kolmogorov complexity
- Small Spans in Scaled Dimension
- Effective Hausdorff dimension in general metric spaces
- Dimension is compression
- Subcomputable Hausdorff function dimension
- Base invariance of feasible dimension
- Generic density and small span theorem
- Dimension, entropy rates, and compression
- On zeros of Martin-Löf random Brownian motion
- Bounded pushdown dimension vs Lempel Ziv information density
- Representation of maxitive measures: An overview
- Relative Kolmogorov complexity and geometry
- The typical constructible object
- Who asked us? How the theory of computing answers questions about analysis
- Calibrating Randomness
- Effective Strong Dimension in Algorithmic Information and Computational Complexity
- ALGORITHMS FOR FRACTAL DIMENSION CALCULATION
- Effective packing dimension of $\Pi ^0_1$-classes
- scientific article; zbMATH DE number 1754653 (Why is no real title available?)
- Avoiding effective packing dimension 1 below array noncomputable c.e. degrees
- The power of backtracking and the confinement of length
- Completeness, Compactness, Effective Dimensions
- Information vs. Dimension: An Algorithmic Perspective
- Effective dimension in some general metric spaces
- Algorithmic Fractal Dimensions in Geometric Measure Theory
- scientific article; zbMATH DE number 7576618 (Why is no real title available?)
- Fractal Intersections and Products via Algorithmic Dimension
- Solovay reducibility and continuity
- STACS 2004
- scientific article; zbMATH DE number 5269064 (Why is no real title available?)
- scientific article; zbMATH DE number 2222024 (Why is no real title available?)
- Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension
- Effective dimensions and relative frequencies
- Constructive dimension and Turing degrees
- Computability versus exact computability of martingales
- Martingale families and dimension in P
- Complex network dimension and path counts
This page was built for publication: Effective fractal dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3159402)
