scientific article
From MaRDI portal
Publication:3705346
zbMath0581.94007MaRDI QIDQ3705346
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Constructive dimension equals Kolmogorov complexity ⋮ The dimensions of individual strings and sequences ⋮ A Correspondence Principle for Exact Constructive Dimension ⋮ Partial Randomness and Dimension of Recursively Enumerable Reals ⋮ The Kolmogorov complexity of infinite words ⋮ Natural halting probabilities, partial randomness, and zeta functions ⋮ Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension ⋮ The Kučera-Gács theorem revisited by Levin ⋮ Exact constructive and computable dimensions ⋮ Dimension is compression ⋮ Algorithmically Independent Sequences ⋮ Algorithmic information theory and its statistical mechanical interpretation ⋮ Error-correcting codes and phase transitions ⋮ Algorithmically independent sequences ⋮ Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences ⋮ Effective Hausdorff dimension in general metric spaces ⋮ Constructive dimension and Turing degrees ⋮ Scaled dimension and the Kolmogorov complexity of Turing-hard sets ⋮ Dimension extractors and optimal decompression ⋮ Cone avoiding closed sets ⋮ Kolmogorov-Loveland randomness and stochasticity ⋮ Algorithmic Fractal Dimensions in Geometric Measure Theory
