Liouville numbers and the computational complexity of changing bases
From MaRDI portal
Publication:2106591
Recommendations
- Computable irrational numbers with representations of surprising complexity
- Liouville, computable, Borel normal and Martin-Löf random numbers
- The Kolmogorov complexity of real numbers.
- A computable absolutely normal Liouville number
- On the complexity of conversion between classic real number representations
Cites work
- scientific article; zbMATH DE number 5595151 (Why is no real title available?)
- scientific article; zbMATH DE number 3678157 (Why is no real title available?)
- scientific article; zbMATH DE number 52121 (Why is no real title available?)
- scientific article; zbMATH DE number 3621859 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 1418967 (Why is no real title available?)
- scientific article; zbMATH DE number 3085862 (Why is no real title available?)
- A computable absolutely normal Liouville number
- Computational Complexity
- Continued fractions of primitive recursive real numbers
- Distribution modulo one and Diophantine approximation
- Liouville numbers and normal numbers
- Liouville, computable, Borel normal and Martin-Löf random numbers
- Nicht konstruktiv beweisbare Sätze der Analysis
- On computable sequences
- On subrecursive representability of irrational numbers, part II
- On the measure of irrationality of the number \(\pi \)
- Rational approximations to algebraic numbers
- Recursive real numbers
- The irrationality exponents of computable numbers
This page was built for publication: Liouville numbers and the computational complexity of changing bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106591)
