Random sequences with respect to a measure defined by two linear fractional transformations
From MaRDI portal
Publication:493656
DOI10.1007/s00224-014-9585-1zbMath1326.03051OpenAlexW2105396054MaRDI QIDQ493656
Publication date: 4 September 2015
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-014-9585-1
Contents, measures, outer measures, capacities (28A12) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the range of self-interacting random walks on an integer interval
- Singularity results for functional equations driven by linear fractional transformations
- Constructive dimension equals Kolmogorov complexity
- Gales suffice for constructive dimension
- The dimensions of individual strings and sequences
- Weighted sums of certain dependent random variables
- Algorithmic Randomness and Complexity
- A characterization of constructive dimension
- Dimensions of Points in Self-Similar Fractals
- A Theory of Program Size Formally Identical to Information Theory
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- A unified approach to the definition of random sequences
- The definition of random sequences
