Abstract
Let C sc and C wc be classes of the semi-computable and weakly computable real numbers, respectively, which are discussed by Weihrauch and Zheng 12. In this paper we show that both C sc and C wc are not closed under the total computable real functions of finite length on some closed interval, although such functions map always a semi-computable real numbers to a weakly computable one. On the other hand, their closures under general total computable real functions are the same and are in fact an algebraic field. This field can also be characterized by the limits of computable sequences of rational numbers with some special converging properties.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K. Ambos-Spies, K. Weihrauch and X. Zheng Weakly computable real numbers. J. of Complexity. 16 (2000), 676–690.
C. Calude, P. Hertling, B. Khoussainov, and Y. Wang Recursive enumerable reals and Chaintin’s O-number, in STACS’98, pp596–606.
G.S. Ce?itin A pesudofundamental sequence that is not equivalent to a monotone one (Russian), Zap. Naučn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI), 20(1971), 263–271.
A. Grzegorczyk On the definitions of recursive real continuous functions, Fund. Math. 44(1957), 61–71.
Ker-I Ko Complexity Theory of Real Functions, Birkhäuser, Berlin, 1991.
M. Pour-El & J. Richards Computability in Analysis and Physics. Springer-Verlag, Berlin, Heidelberg, 1989.
R.M. Robinson Review of “R. Peter: ‘Rekursive Funktionen’, Akad. Kiado. Budapest, 1951,” J. of Symbolic Logic, 16 (1951), 280.
E. Specker DeNicht konstruktiv beweisbare Sätze der Analysis, J. Symbolic Logic 14 (1949), 145–158
A.M. Turing On computable number, with an application to the “Entscheidungsproblem”. Proceeding of the London Mathematical Society, 43 (1936), no.2, 230–265.
K. Weihrauch An Introduction to Computability. EATCS Monographs on Theoretical Computer Science Vol. 9, Springer-Verlag, Berlin, Heidelberg, 1987.
K. Weihrauch Computable Analysis. Texts in Theoretical Computer Science, Springer-Verlag, Heidelberg 2000.
K. Weihrauch & X. Zheng A finite hierarchy of the recursively enumerable real numbers, MFCS’98 Brno, Czech Republic, August 1998, pp798–806.
X. Zheng The closure properties on real numbers under limits and computable operations. COCOON’2000, Sydney, Australia, July 26-28, 2000. pp170–179.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rettinger1, R., Zheng, X., Gengler, R., von Braunmühl, B. (2001). Weakly Computable Real Numbers and Total Computable Real Functions. In: Wang, J. (eds) Computing and Combinatorics. COCOON 2001. Lecture Notes in Computer Science, vol 2108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44679-6_65
Download citation
DOI: https://doi.org/10.1007/3-540-44679-6_65
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42494-9
Online ISBN: 978-3-540-44679-8
eBook Packages: Springer Book Archive