Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
A Banach-Mazur Computable But Not Markov Computable Function on the Computable Real Numbers
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A sequentially computable function that is not effectively continuous at any point
Journal of Complexity
Hi-index | 0.00 |
We present Mazur's continuity results for Banach-Mazur computable functions on computable real numbers in the slightly more general setting of metric spaces satisfying suitable computability conditions. Additionally, we prove that the image of a computable, computably convergent sequence under a Banach-Mazur computable function is again computably convergent.