Computable Versions of Baire's Category Theorem

Vasco Brattka, in: MFCS 2001: Mathematical Foundations of Computer Science , Lecture Notes in Computer Science 2136, 224-235, Springer, Berlin 2001


Abstract

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 used to construct interesting counterexamples, such as a computable but nowhere differentiable function. © 2001 Springer-Verlag Berlin

Electronical Versions

© 2001 Springer-Verlag Berlin

© 2001 Vasco Brattka, FernUniversität Hagen