Computer Science – Logic in Computer Science
Scientific paper
2005-08-15
pp.177-206 in Theory of Computing Systems vol.41 (2007)
Computer Science
Logic in Computer Science
previous version (extended abstract) has appeared in pp.562-571 of "Proc. 1st Conference on Computability in Europe" (CiE'05),
Scientific paper
10.1007/s00224-006-1343-6
By the sometimes so-called 'Main Theorem' of Recursive Analysis, every computable real function is necessarily continuous. We wonder whether and which kinds of HYPERcomputation allow for the effective evaluation of also discontinuous f:R->R. More precisely the present work considers the following three super-Turing notions of real function computability: * relativized computation; specifically given oracle access to the Halting Problem 0' or its jump 0''; * encoding real input x and/or output y=f(x) in weaker ways also related to the Arithmetic Hierarchy; * non-deterministic computation. It turns out that any f:R->R computable in the first or second sense is still necessarily continuous whereas the third type of hypercomputation does provide the required power to evaluate for instance the discontinuous sign function.
Ziegler Martin
No associations
LandOfFree
Real Hypercomputation and Continuity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Real Hypercomputation and Continuity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Real Hypercomputation and Continuity will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-138283