2000 character limit reached
On representations of real numbers and the computational complexity of converting between such representations
Published 14 Apr 2023 in math.LO and cs.CC | (2304.07227v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.