Recursively enumerable sets and degrees
Recursively enumerable sets and degrees
Markov's constructive analysis; a participant's view
Theoretical Computer Science - Special issue on computability and complexity in analysis
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
Banach-Mazur Computable Functions on Metric Spaces
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
Randomness with Respect to the Signed-Digit Representation
Fundamenta Informaticae
Randomness with Respect to the Signed-Digit Representation
Fundamenta Informaticae
| Hi-index | 0.00 |
P. Hertling [Lecture Notes in Computer Science, vol. 2380, Springer, Berlin, 2002, pp. 962-972; Ann. Pure Appl. Logic 132 (2005) 227-246] showed that there exists a sequentially computable function mapping all computable real numbers to computable real numbers that is not effectively continuous. Here, that result is strengthened: a sequentially computable function on the computable real numbers is constructed that is not effectively continuous at any point.