Monotonically computable real numbers (2002)
by
Xizhong Zheng
,
Robert Rettinger
,
George Barmpalias
| Venue: | Math. Log. Quart |
| Citations: | 7 - 5 self |
BibTeX
@ARTICLE{Zheng02monotonicallycomputable,
author = {Xizhong Zheng and Robert Rettinger and George Barmpalias},
title = {Monotonically computable real numbers},
journal = {Math. Log. Quart},
year = {2002},
volume = {48},
pages = {2002}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Key words h-monotone computable real, ω-monotone computable real.
Citations
| 914 | On computable numbers, with an application to the ”Entscheidungsproblem - Turing - 1936 |
| 33 | Recursive real numbers - Rice - 1954 |
| 30 | Nicht konstruktiv beweisbare Sätze der Analysis - Specker - 1949 |
| 25 | Some Computability-Theoretical Aspects of Reals and - Downey |
| 15 | Weakly computable real numbers - Ambos-Spies, Weihrauch, et al. |
| 12 | Recursive approximability of real numbers - Zheng |
| 11 | Criteria of Constructibility for Real Numbers - Myhill - 1953 |
| 10 | Computable approximations of reals: An information-theoretic analysis - Calude, Hertling - 1998 |
| 9 | Weakly computable real numbers and total computable real functions - Rettinger, Zheng, et al. - 2001 |
| 5 | On the hierarchy and extension of monotonically computable real numbers - Rettinger, Zheng - 2003 |
| 3 | Physical Review A - Robinson, Earnshaw - 1992 |
| 2 | Soare, Recursively Enumerable Sets and Degrees (Springer-Verlag - I - 1987 |
| 1 | Calude, A characterization of c. e. random reals - S - 2002 |
