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

04/14/2023
by   Amir M. Ben-Amram, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/07/2018

Computational Complexity of Space-Bounded Real Numbers

In this work we study the space complexity of computable real numbers re...
research
10/27/2014

Maximally Informative Hierarchical Representations of High-Dimensional Data

We consider a set of probabilistic functions of some input variables as ...
research
02/07/2020

Computational Aspects of Sturdy and Flimsy Numbers

Following Stolarsky, we say that a natural number n is flimsy in base b ...
research
05/07/2017

Generating Memorable Mnemonic Encodings of Numbers

The major system is a mnemonic system that can be used to memorize seque...
research
01/16/2019

The notion of "Unimaginable Numbers" in computational number theory

Literature considers under the name unimaginable numbers any positive in...
research
03/18/2018

Directional emphasis in ambisonics

We describe an ambisonics enhancement method that increases the signal s...
research
04/11/2019

Real quadratic Julia sets can have arbitrarily high complexity

We show that there exist real parameters c for which the Julia set J_c o...

Please sign up or login with your details

Forgot password? Click here to reset