Computable Versions of Baire's Category Theorem

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.

• Type: Conference
• Year: 2001
• Where: MFCS
• Authors: Vasco Brattka
• Keywords: Computable, Computable Versions, Different Computable Versions, MFCS 2001, Theoretical Computer Science