On continued fraction randomness and normality
From MaRDI portal
Publication:2672257
DOI10.1016/J.IC.2022.104876OpenAlexW4212895908MaRDI QIDQ2672257
Prateek Vishnoi, Satyadev Nandakumar
Publication date: 8 June 2022
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2022.104876
algorithmic information theorymartingalescontinued fractionsMartin-Löf randomnesseffective Hausdorff dimension
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Metric theory of continued fractions (11K50)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Effective Hausdorff dimension in general metric spaces
- Iterated function systems and control languages
- The dimensions of individual strings and sequences
- ABSOLUTELY ABNORMAL AND CONTINUED FRACTION NORMAL NUMBERS
- Algorithmic Randomness and Complexity
- Dimensions of Points in Self-Similar Fractals
- A Theory of Program Size Formally Identical to Information Theory
- Computable absolutely normal numbers and discrepancies
- Logical basis for information theory and probability theory
- A unified approach to the definition of random sequences
- The definition of random sequences
- Ergodic Theory
- An introduction to Kolmogorov complexity and its applications
This page was built for publication: On continued fraction randomness and normality
