Interplay between insertion of zeros and the complexity of Dedekind cuts
I Georgiev - Computability, 2024 - journals.sagepub.com
The topic of this paper is the study of the possibility of effective conversions between
different representations of irrational numbers. We are interested in subrecursive …
different representations of irrational numbers. We are interested in subrecursive …
On representations of real numbers and the computational complexity of converting between such representations
AM Ben-Amram, L Kristiansen, JG Simonsen - arXiv preprint arXiv …, 2023 - arxiv.org
arXiv:2304.07227v1 [math.LO] 14 Apr 2023 Page 1 arXiv:2304.07227v1 [math.LO] 14 Apr 2023
On representations of real numbers and the computational complexity of converting between …
On representations of real numbers and the computational complexity of converting between …
Subrecursive incomparability of the graphs of standard and dual Baire sequences
I Georgiev - Annual of Sofia University St. Kliment Ohridski …, 2022 - admin.uni-sofia.bg
Our main question of interest is the existence or the non-existence of a subrecursive
reduction between different representations of the irrational numbers. For any …
reduction between different representations of the irrational numbers. For any …
Comparing the complexity of irrational number representations
I GEORGIEV - МАЛЬЦЕВСКИЕ ЧТЕНИЯ, 2022 - old.math.nsc.ru
Irrational numbers can be represented in many different ways: Cauchy sequences,
Dedekind cuts, continued fractions, etc. Without any restriction on the computations all …
Dedekind cuts, continued fractions, etc. Without any restriction on the computations all …