Interplay between insertion of zeros and the complexity of Dedekind cuts

Author:

Georgiev Ivan1

Affiliation:

1. Faculty of Mathematics and Informatics, Sofia University, 5 James Bourchier blvd., 1164 Sofia, Bulgaria

Abstract

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 computations, in which we disallow the use of unbounded search. It is well-known that the base expansion of an irrational number can be subrecursively computed from its Dedekind cut, but in the reverse direction this is not subrecursively possible. Thus it would be natural to try to understand how additional properties of the base expansion, such as the presence of specific patterns of zero digits, correlate with the complexity of the Dedekind cut. Our first result roughly states that if large parts of zero digits dominate over smaller parts of arbitrary digits and the base expansion has elementary complexity, then the Dedekind cut also has elementary complexity. Much more interesting is the case when one allows large parts of zero digits to alternate with large parts of arbitrary digits. We compare the complexity of the Dedekind cuts of an arbitrary irrational number and another irrational number, obtained by inserting long sequences of zero digits in its base expansion. We provide examples in which (1) both numbers have elementary Dedekind cuts, (2) the first number has complex Dedekind cut and elementary base expansion, but the second number has elementary Dedekind cut and (3) both numbers have complex Dedekind cuts and elementary base expansions. An open question remains, whether it is possible for the first number to have elementary Dedekind cut, while the second number has complex Dedekind cut.

Publisher

IOS Press

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3