Liouville, computable, Borel normal and Martin-Löf random numbers

DOI10.1007/S00224-017-9767-8MaRDI QIDQ1787950zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

Kolmogorov complexityirrationality exponentLiouville, computable, normal, and random numbers

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• A computable absolutely normal Liouville number
• Normality and finite-state dimension of Liouville numbers
• scientific article; zbMATH DE number 3345491
• The Kolmogorov complexity of real numbers.
• Publication:4934359

Cites work

• scientific article; zbMATH DE number 3125786 (Why is no real title available?)
• scientific article; zbMATH DE number 3678157 (Why is no real title available?)
• scientific article; zbMATH DE number 44693 (Why is no real title available?)
• scientific article; zbMATH DE number 51878 (Why is no real title available?)
• scientific article; zbMATH DE number 4128138 (Why is no real title available?)
• scientific article; zbMATH DE number 1911266 (Why is no real title available?)
• scientific article; zbMATH DE number 3311772 (Why is no real title available?)
• scientific article; zbMATH DE number 3095523 (Why is no real title available?)
• A computable absolutely normal Liouville number
• A polynomial-time algorithm for computing absolutely normal numbers
• A topological characterization of random sequences
• Absolutely Abnormal Numbers
• Addendum to: On the rational approximation of the sum of the reciprocals of the Fermat numbers
• Algorithmic randomness and complexity.
• An "Oceans of Zeros" Proof That a Certain Non-Liouville Number is Transcendental
• Kolmogorov complexity and Hausdorff dimension
• Liouville numbers and normal numbers
• Logical basis for information theory and probability theory
• Measure, topology, and fractal geometry
• Neverending fractions. An introduction to continued fractions
• Noiseless coding of combinatorial sources, Hausdorff dimension, and Kolmogorov complexity
• Normality and finite-state dimension of Liouville numbers
• On partial randomness
• On the theorem of Jarník and Besicovitch
• Random Generators and Normal Numbers
• Random elements in effective topological spaces with measure.
• Randomness as an invariant for number representations
• Refined Bounds on Kolmogorov Complexity for ω-Languages
• The Kolmogorov complexity of real numbers.
• The definition of random sequences
• The irrationality exponents of computable numbers

Cited in

(6)

• Liouville numbers and the computational complexity of changing bases
• scientific article; zbMATH DE number 3345491 (Why is no real title available?)
• 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)