| Issue |
RAIRO-Theor. Inf. Appl.
Volume 41, Number 1, January-March 2007
Real Numbers
|
|
|---|---|---|
| Page(s) | 3 - 25 | |
| DOI | https://doi.org/10.1051/ita:2007008 | |
| Published online | 24 April 2007 | |
On the hierarchies of Δ20-real numbers
1
Department of Computer Science, Jiangsu University, Zhenjiang 212013, China.
2
Theoretische Informatik, BTU Cottbus, 03044 Cottbus, Germany; zheng@tu-cottbus.de
A real number x is called Δ20 if its binary expansion corresponds to a Δ20-set of natural numbers. Such reals are just the limits of computable sequences of rational numbers and hence also called computably approximable. Depending on how fast the sequences converge, Δ20-reals have different levels of effectiveness. This leads to various hierarchies of Δ20 reals. In this survey paper we summarize several recent developments related to such kind of hierarchies shown by the author and his collaborators.
Mathematics Subject Classification: 03D55 / 26E40 / 68Q15
Key words: Computably approximable reals / Δ20-reals / hierarchy.
© EDP Sciences, 2007
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.