Random sequences with respect to a measure defined by two linear fractional transformations
From MaRDI portal
(Redirected from Publication:493656)
Recommendations
Cites work
- A characterization of constructive dimension
- A Theory of Program Size Formally Identical to Information Theory
- A unified approach to the definition of random sequences
- Algorithmic randomness and complexity.
- Constructive dimension equals Kolmogorov complexity
- Dimensions of Points in Self-Similar Fractals
- Gales suffice for constructive dimension
- scientific article; zbMATH DE number 3129881 (Why is no real title available?)
- scientific article; zbMATH DE number 3489016 (Why is no real title available?)
- scientific article; zbMATH DE number 1223638 (Why is no real title available?)
- On the range of self-interacting random walks on an integer interval
- Singularity results for functional equations driven by linear fractional transformations
- 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
- The dimensions of individual strings and sequences
- Weighted sums of certain dependent random variables
This page was built for publication: Random sequences with respect to a measure defined by two linear fractional transformations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q493656)