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.
Work supported by DFG Grant BR 1807/4-1
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
V. Brattka. Computable invariance. Theoretical Computer Science, 210:3–20, 1999.
V. Brattka. Recursive and computable operations over topological structures. Informatik Berichte 255, FernUniversität Hagen, July 1999. Dissertation.
V. Brattka. Computability of Banach Space Principles. Informatik Berichte, FernUniversität Hagen, June 2001.
V. Brattka and G. Presser. Computability on subsets of metric spaces. submitted, 2000.
V. Brattka and K. Weihrauch. Computability on subsets of Euclidean space I: Closed and compact subsets. Theoretical Computer Science, 219:65–93, 1999.
D. Bridges and F. Richman. Varieties of Constructive Mathematics. Cambridge University Press, Cambridge, 1987.
C. Goffman and G. Pedrick. First Course in Functional Analysis. Prentince-Hall, Englewood Cliffs, 1965.
K.-I. Ko. Complexity Theory of Real Functions. Birkhäuser, Boston, 1991.
S. S. Kutateladze. Fundamentals of Functional Analysis. Kluwer Academic Publishers, Dordrecht, 1996.
P. Odifreddi. Classical Recursion Theory. North-Holland, Amsterdam, 1989.
M. B. Pour-El and J. I. Richards. Computability in Analysis and Physics. Springer, Berlin, 1989.
K. Weihrauch. Computability. Springer, Berlin, 1987.
K. Weihrauch. Computable Analysis. Springer, Berlin, 2000.
M. Yasugi, T. Mori, and Y. Tsujii. Effective properties of sets and functions in metric spaces with computability structure. Theoretical Computer Science, 219:467–486, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brattka, V. (2001). Computable Versions of Baire’s Category Theorem. In: Sgall, J., Pultr, A., Kolman, P. (eds) Mathematical Foundations of Computer Science 2001. MFCS 2001. Lecture Notes in Computer Science, vol 2136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44683-4_20
Download citation
DOI: https://doi.org/10.1007/3-540-44683-4_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42496-3
Online ISBN: 978-3-540-44683-5
eBook Packages: Springer Book Archive