On representations of real numbers and the computational complexity of converting between such representations

2023/04/14 by Ben-Amram, Amir M., Kristiansen, Lars, Simonsen, Jakob Grue
#03D78 #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO)

paper · doi:10.48550/arxiv.2304.07227

Abstract

We study the computational complexity of converting one representation of real numbers into another representation. Typical examples of representations are Cauchy sequences, base-10 expansions, Dedekind cuts and continued fractions.

Related

• A new approach to the real numbers
• On some generalizations of real numbers representations
• Subrecursive Approximations of Irrational Numbers by Variable Base Sums
• Real-number Computability from the Perspective of Computer Assisted Proofs in Analysis
• Integer Complexity: Experimental and Analytical Results II