A tight upper bound on Kolmogorov complexity and uniformly optimal prediction
From MaRDI portal
Publication:1387818
DOI10.1007/s002240000086zbMath0896.68080OpenAlexW2020728339MaRDI QIDQ1387818
Publication date: 1 October 1998
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002240000086
Related Items
Finite-state dimension, 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, Fractal dimension and logarithmic loss unpredictability., Exact constructive and computable dimensions, Dimensions of Points in Self-similar Fractals, Dimension is compression, ALGORITHMS FOR FRACTAL DIMENSION CALCULATION, Fractal Intersections and Products via Algorithmic Dimension, Algorithmic information theory and its statistical mechanical interpretation, Fractal dimension versus process complexity, On Oscillation-free ε-random Sequences, Complex network dimension and path counts, Dimension, entropy rates, and compression, Representation of left-computable \(\varepsilon \)-random reals, Prediction and dimension, Effective Hausdorff dimension in general metric spaces, Scaled dimension and the Kolmogorov complexity of Turing-hard sets, Constructive Dimension and Hausdorff Dimension: The Case of Exact Dimension, Calibrating Randomness, On partial randomness, Kolmogorov-Loveland randomness and stochasticity, A Kolmogorov complexity characterization of constructive Hausdorff dimension., Algorithmic Fractal Dimensions in Geometric Measure Theory, The Kolmogorov complexity of real numbers., Entropy rates and finite-state dimension
