Liouville numbers and the computational complexity of changing bases

DOI10.1007/978-3-030-51466-2_5OpenAlexW3038064903MaRDI QIDQ2106591FDOQ2106591

Authors: Sune Kristian Jakobsen, Jakob Grue Simonsen 

Publication date: 16 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-51466-2_5

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

zbMATH Keywords

computational complexityDiophantine approximationnumber theorycomputability

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Computational Complexity
• Title not available (Why is that?)
• Title not available (Why is that?)
• A computable absolutely normal Liouville number
• Distribution modulo one and Diophantine approximation
• Title not available (Why is that?)
• Liouville numbers and normal numbers
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Rational approximations to algebraic numbers
• Nicht konstruktiv beweisbare Sätze der Analysis
• Title not available (Why is that?)
• On the measure of irrationality of the number \(\pi \)
• Liouville, computable, Borel normal and Martin-Löf random numbers
• The irrationality exponents of computable numbers
• On computable sequences
• Recursive real numbers
• Continued fractions of primitive recursive real numbers
• On subrecursive representability of irrational numbers, part II

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)