Baire category and nowhere differentiability for feasible real functions

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A notion of resource-bounded Baire category is developed for the class P C[0,1] of all polynomial-time computable real-valued functions on the unit interval. The meager subsets of P C[0,1] are characterized in terms of resource-bounded Banach-Mazur games. This characterization is used to prove that, in the sense of Baire category, almost every function in P C[0,1] is nowhere differentiable. This is a complexity-theoretic extension of the analogous classical result that Banach proved for the class C[0, 1] in 1931. © 2001 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Breutzmann, J. M., Juedes, D. W., & Lutz, J. H. (2001). Baire category and nowhere differentiability for feasible real functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2223 LNCS, pp. 219–230). https://doi.org/10.1007/3-540-45678-3_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free