Liouville numbers and the computational complexity of changing bases

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

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

zbMATH Keywords

computational complexityDiophantine approximationcomputabilitynumber theory

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• On the measure of irrationality of the number \(\pi \)
• Liouville numbers and normal numbers
• Liouville, computable, Borel normal and Martin-Löf random numbers
• The irrationality exponents of computable numbers
• Continued fractions of primitive recursive real numbers
• On computable sequences
• On subrecursive representability of irrational numbers, part II
• Computational Complexity
• A computable absolutely normal Liouville number
• Recursive real numbers
• Nicht konstruktiv beweisbare Sätze der Analysis
• Rational approximations to algebraic numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Liouville numbers and the computational complexity of changing bases