10.23638/LMCS-14(3:13)2018
https://lmcs.episciences.org/4287
Brattka, Vasco
Vasco
Brattka
A Galois connection between Turing jumps and limits
Limit computable functions can be characterized by Turing jumps on the input
side or limits on the output side. As a monad of this pair of adjoint
operations we obtain a problem that characterizes the low functions and dually
to this another problem that characterizes the functions that are computable
relative to the halting problem. Correspondingly, these two classes are the
largest classes of functions that can be pre or post composed to limit
computable functions without leaving the class of limit computable functions.
We transfer these observations to the lattice of represented spaces where it
leads to a formal Galois connection. We also formulate a version of this result
for computable metric spaces. Limit computability and computability relative to
the halting problem are notions that coincide for points and sequences, but
even restricted to continuous functions the former class is strictly larger
than the latter. On computable metric spaces we can characterize the functions
that are computable relative to the halting problem as those functions that are
limit computable with a modulus of continuity that is computable relative to
the halting problem. As a consequence of this result we obtain, for instance,
that Lipschitz continuous functions that are limit computable are automatically
computable relative to the halting problem. We also discuss 1-generic points as
the canonical points of continuity of limit computable functions, and we prove
that restricted to these points limit computable functions are computable
relative to the halting problem. Finally, we demonstrate how these results can
be applied in computable analysis.
episciences.org
Mathematics - Logic
Computer Science - Logic in Computer Science
Attribution 4.0 International (CC BY 4.0)
2018-08-31
2018-08-31
2018-08-31
eng
journal article
arXiv:1802.01355
10.48550/arXiv.1802.01355
1860-5974
https://lmcs.episciences.org/4287/pdf
VoR
application/pdf
Logical Methods in Computer Science
Volume 14, Issue 3
Computability and logic
Researchers
Students