Computability
Complexity theory of real functions
Complexity theory of real functions
Theoretical Computer Science - Special issue on real numbers and computers
Computability on subsets of Euclidean space I: closed and compact subsets
Theoretical Computer Science - Special issue on computability and complexity in analysis
Effective properties of sets and functions in metric spaces with computability structure
Theoretical Computer Science - Special issue on computability and complexity in analysis
Computable analysis: an introduction
Computable analysis: an introduction
The Inversion Problem for Computable Linear Operators
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |
We study different computable versions of Baire's Category Theorem in computable analysis. Similarly, as in constructive analysis, different logical forms of this theorem lead to different computational interpretations. We demonstrate that, analogously to the classical theorem, one of the computable versions of the theorem can be usedto construct interesting counterexamples, such as a computable but nowhere differentiable function.