2000 character limit reached
Polynomial Space Randomness in Analysis
Published 29 Sep 2015 in cs.CC | (1509.08825v2)
Abstract: We study the interaction between polynomial space randomness and a fundamental result of analysis, the Lebesgue differentiation theorem. We generalize Ko's framework for polynomial space computability in $\mathbb{R}n$ to define \textit{weakly pspace-random} points, a new variant of polynomial space randomness. We show that the Lebesgue differentiation theorem holds for every weakly pspace-random point.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.