Liouville, computable, Borel normal and Martin-Löf random numbers
From MaRDI portal
Publication:1787950
DOI10.1007/S00224-017-9767-8zbMATH Open1436.03225OpenAlexW2609635890WikidataQ114230788 ScholiaQ114230788MaRDI QIDQ1787950FDOQ1787950
Authors: Cristian S. Calude, Ludwig Staiger
Publication date: 5 October 2018
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-017-9767-8
Recommendations
Algorithmic randomness and dimension (03D32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
Cites Work
- Algorithmic randomness and complexity.
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Kolmogorov complexity of real numbers.
- Noiseless coding of combinatorial sources, Hausdorff dimension, and Kolmogorov complexity
- Kolmogorov complexity and Hausdorff dimension
- On partial randomness
- On the theorem of Jarník and Besicovitch
- Title not available (Why is that?)
- A computable absolutely normal Liouville number
- The definition of random sequences
- Title not available (Why is that?)
- Title not available (Why is that?)
- Normality and finite-state dimension of Liouville numbers
- Measure, topology, and fractal geometry
- Logical basis for information theory and probability theory
- Title not available (Why is that?)
- Liouville numbers and normal numbers
- Absolutely Abnormal Numbers
- Random Generators and Normal Numbers
- Title not available (Why is that?)
- A polynomial-time algorithm for computing absolutely normal numbers
- Addendum to: On the rational approximation of the sum of the reciprocals of the Fermat numbers
- An "Oceans of Zeros" Proof That a Certain Non-Liouville Number is Transcendental
- The irrationality exponents of computable numbers
- Neverending fractions. An introduction to continued fractions
- A topological characterization of random sequences
- Title not available (Why is that?)
- Random elements in effective topological spaces with measure.
- Refined Bounds on Kolmogorov Complexity for ω-Languages
- Randomness as an invariant for number representations
Cited In (6)
- Title not available (Why is that?)
- Liouville numbers and the computational complexity of changing bases
- A computable absolutely normal Liouville number
- Normality and finite-state dimension of Liouville numbers
- Bi-immunity over different size alphabets
- Irrationality exponent, Hausdorff dimension and effectivization
This page was built for publication: Liouville, computable, Borel normal and Martin-Löf random numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1787950)