Abstract
The sometimes so-called Main Theorem of Recursive Analysis implies that any computable real function is necessarily continuous. We consider three relaxations of this common notion of real computability for the purpose of treating also discontinuous functions f: ℝ→ℝ:
-
non-deterministic computation;
-
relativized computation, specifically given access to oracles like ∅′ or ∅″;
-
encoding input x εℝ and/or output y = f(x) in weaker ways according to the Real Arithmetic Hierarchy.
It turns out that, among these approaches, only the first one provides the required power.
This is a preview of subscription content, log in via an institution to check access.
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
Barmpalias, G.: A Transfinite Hierarchy of Reals. Mathematical Logic Quarterly 49(2), 163–172 (2003)
Brattka, V., Hertling, P.: Topological Properties of Real Number Representations. Theoretical Computer Science 284, 241–257 (2002)
Grzegorczyk, A.: On the Definitions of Computable Real Continuous Functions. Fundamenta Mathematicae 44, 61–77 (1957)
Ho, C.-K.: Relatively Recursive Real Numbers and Real Functions. Theoretical Computer Science 210, 99–120 (1999)
Ko, K.-I.: Complexity Theory of Real Functions. Birkhäuser, Basel (1991)
Pour-El, M.B., Richards, J.I.: Computability in Analysis and Physics. Springer, Heidelberg (1989)
Randolph, J.F.: Basic Real and Abstract Analysis. Academic Press, London (1968)
Soare, R.I.: Recursively Enumerable Sets and Degrees. Springer, Heidelberg (1987)
Spaan, E., Torenvliet, L., van Emde Boas, P.: Nondeterminism, Fairness and a Fundamental Analogy. In: The Bulletin of the European Association for Theoretical Computer Science (EATCS Bulletin), vol. 37, pp. 186–193 (1989)
Thomas, W.: Automata on Infinite Objects. In: Handbook of Theoretical Computer Science (Formal Models and Semantics), vol. B, pp. 133–191. Elsevier, Amsterdam (1990)
Turing, A.M.: On Computable Numbers, with an Application to the Entscheidungsproblem. Proc. London Math. Soc. 42(2), 230–265 (1936)
Turing, A.M.: On Computable Numbers, with an Application to the Entscheidungsproblem. A correction. Proc. London Math. Soc. 43(2), 544–546 (1937)
Weihrauch, K.: Computable Analysis. Springer, Heidelberg (2001)
Zheng, X., Weihrauch, K.: The Arithmetical Hierarchy of Real Numbers. Mathematical Logic Quarterly 47, 51–65 (2001)
Zheng, X.: Recursive Approximability of Real Numbers. Mathematical Logic Quarterly 48(suppl. 1), 131–156 (2002)
Zhong, N., Weihrauch, K.: Computability Theory of Generalized Functions. J. ACM 50, 469–505 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ziegler, M. (2005). Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds) New Computational Paradigms. CiE 2005. Lecture Notes in Computer Science, vol 3526. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11494645_68
Download citation
DOI: https://doi.org/10.1007/11494645_68
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26179-7
Online ISBN: 978-3-540-32266-5
eBook Packages: Computer ScienceComputer Science (R0)