Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism
M. Ziegler, in: Proc. CiE 2005: New Computational Paradigms, Springer, 2005, pp. 562–571.
Download
No fulltext has been uploaded.
Conference Paper
| Published
| English
Author
Ziegler, Martin
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:R->R:<br>*) non-deterministic computation;<br>*) relativized computation, specifically given access to oracles like 0' or 0'';<br>*) encoding input x and/or output y=f(x) in weaker ways according to the Real Arithmetic Hierarchy.<br>It turns out that, among these approaches, only the first one provides the required power.
Publishing Year
Proceedings Title
Proc. CiE 2005: New Computational Paradigms
Volume
3526
Page
562-571
ISBN
LibreCat-ID
Cite this
Ziegler M. Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism. In: Proc. CiE 2005: New Computational Paradigms. Vol 3526. Springer; 2005:562-571. doi:10.1007/11494645_68
Ziegler, M. (2005). Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism. In Proc. CiE 2005: New Computational Paradigms (Vol. 3526, pp. 562–571). Springer. https://doi.org/10.1007/11494645_68
@inproceedings{Ziegler_2005, title={Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism}, volume={3526}, DOI={10.1007/11494645_68}, booktitle={Proc. CiE 2005: New Computational Paradigms}, publisher={Springer}, author={Ziegler, Martin}, year={2005}, pages={562–571} }
Ziegler, Martin. “Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism.” In Proc. CiE 2005: New Computational Paradigms, 3526:562–71. Springer, 2005. https://doi.org/10.1007/11494645_68.
M. Ziegler, “Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism,” in Proc. CiE 2005: New Computational Paradigms, 2005, vol. 3526, pp. 562–571.
Ziegler, Martin. “Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism.” Proc. CiE 2005: New Computational Paradigms, vol. 3526, Springer, 2005, pp. 562–71, doi:10.1007/11494645_68.
Google Scholar
ISBN Search