Gales suffice for constructive dimension
From MaRDI portal
Recommendations
Cites work
- A unified approach to the definition of random sequences
- Almost everywhere high nonuniform complexity
- scientific article; zbMATH DE number 1670880 (Why is no real title available?)
- scientific article; zbMATH DE number 2086652 (Why is no real title available?)
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- The definition of random sequences
- Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
Cited in
(9)- Scaled dimension and the Kolmogorov complexity of Turing-hard sets
- Dimension extractors and optimal decompression
- The dimensions of individual strings and sequences
- Dimension, entropy rates, and compression
- scientific article; zbMATH DE number 1670880 (Why is no real title available?)
- A characterization of constructive dimension
- Random sequences with respect to a measure defined by two linear fractional transformations
- Algorithmic dimensions via learning functions
- Constructive dimension equals Kolmogorov complexity
This page was built for publication: Gales suffice for constructive dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1007560)