scientific article; zbMATH DE number 2216397
From MaRDI portal
Publication:5697037
zbMath1080.03031MaRDI QIDQ5697037
Publication date: 19 October 2005
Full work available at URL: http://d-nb.info/975232371
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
fractal dimensioncomputabilitygeometric measure theoryeffective Hausdorff dimensioncomputable measurealgorithmic entropyKolmogorov-Loveland random sequencesSchnorr dimensionnonmonotonic betting games
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Fractals (28A80) Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45)
Related Items
A Correspondence Principle for Exact Constructive Dimension ⋮ Propagation of partial randomness ⋮ Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension ⋮ Compressibility and Kolmogorov complexity ⋮ Exact constructive and computable dimensions ⋮ A note on density estimation for binary sequences ⋮ Algorithmically Independent Sequences ⋮ Fractal Intersections and Products via Algorithmic Dimension ⋮ On effectively closed sets of effective strong measure zero ⋮ Subcomputable Hausdorff function dimension ⋮ Fractal dimension versus process complexity ⋮ Effectively closed sets of measures and randomness ⋮ Refined Bounds on Kolmogorov Complexity for ω-Languages ⋮ Algorithmically independent sequences ⋮ Translating the Cantor set by a random real ⋮ Turing degrees of reals of positive effective packing dimension ⋮ Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences ⋮ Effective Hausdorff dimension in general metric spaces ⋮ Unnamed Item ⋮ Constructive dimension and Turing degrees ⋮ Effective dimension of points visited by Brownian motion ⋮ Optimal bounds for single-source Kolmogorov extractors ⋮ Dimension extractors and optimal decompression ⋮ Martin-Löf randomness and Galton-Watson processes ⋮ Randomness and Computability: Open Questions ⋮ Effective symbolic dynamics, random points, statistical behavior, complexity and entropy ⋮ Unified characterizations of lowness properties via Kolmogorov complexity ⋮ Kolmogorov-Loveland randomness and stochasticity ⋮ Algorithmic Fractal Dimensions in Geometric Measure Theory ⋮ Symbolic dynamics: entropy = dimension = complexity
