Effective fractal dimensions
entropycomputational complexitymartingalesHausdorff dimensionpacking dimensionKolmogorov complexityrandom sequencesconstructive dimensionresource-bounded dimensiongalescircuit-size complexityAlgorithmic information theorypolynomial-time degrees
Hausdorff and packing measures (28A78) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Theory of numerations, effectively presented structures (03D45) Complexity of computation (including implicit computational complexity) (03D15)
- 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?)
- A generalization of Chaitin's halting probability \(\Omega\) and halting self-similar sets
- Noiseless coding of combinatorial sources, Hausdorff dimension, and Kolmogorov complexity
- Small Spans in Scaled Dimension
- Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension
- scientific article; zbMATH DE number 5269064 (Why is no real title available?)
- Complex network dimension and path counts
- Subcomputable Hausdorff function dimension
- Avoiding effective packing dimension 1 below array noncomputable c.e. degrees
- Bounded pushdown dimension vs Lempel Ziv information density
- Generic density and small span theorem
- STACS 2004
- Algorithmic Fractal Dimensions in Geometric Measure Theory
- The typical constructible object
- Constructive dimension and Turing degrees
- On zeros of Martin-Löf random Brownian motion
- Solovay reducibility and continuity
- ALGORITHMS FOR FRACTAL DIMENSION CALCULATION
- Calibrating Randomness
- Effective packing dimension of $\Pi ^0_1$-classes
- Fractal Intersections and Products via Algorithmic Dimension
- Effective Hausdorff dimension in general metric spaces
- Computability versus exact computability of martingales
- Representation of maxitive measures: An overview
- scientific article; zbMATH DE number 7576618 (Why is no real title available?)
- Effective dimension in some general metric spaces
- Effective Strong Dimension in Algorithmic Information and Computational Complexity
- Dimension is compression
- The power of backtracking and the confinement of length
- Base invariance of feasible dimension
- Effective dimensions and relative frequencies
- Dimension, entropy rates, and compression
- scientific article; zbMATH DE number 1754653 (Why is no real title available?)
- Relative Kolmogorov complexity and geometry
- Completeness, Compactness, Effective Dimensions
- scientific article; zbMATH DE number 2222024 (Why is no real title available?)
- Martingale families and dimension in P
- Who asked us? How the theory of computing answers questions about analysis
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)
