Abstract
AbstractA notion of resource‐bounded Baire category is developed for the class PC[0,1] of all polynomial‐time computable real‐valued functions on the unit interval. The meager subsets of PC[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 PC[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. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
