Back to Search
Start Over
Ergodic Theorems and Converses for PSPACE Functions.
- Source :
-
Theory of Computing Systems . Jun2023, Vol. 67 Issue 3, p491-520. 30p. - Publication Year :
- 2023
-
Abstract
- We initiate the study of effective pointwise ergodic theorems in resource-bounded settings. Classically, the convergence of the ergodic averages for integrable functions can be arbitrarily slow (Krengel Monatshefte Für Mathematik 86, 3–6 1978). In contrast, we show that for a class of PSPACE L1 functions, and a class of PSPACE computable measure-preserving ergodic transformations, the ergodic average exists and is equal to the space average on every EXP random. We establish a partial converse that PSPACE non-randomness can be characterized as non-convergence of ergodic averages. Further, we prove that there is a class of resource-bounded randoms, viz. SUBEXP-space randoms, on which the corresponding ergodic theorem has an exact converse - a point x is SUBEXP-space random if and only if the corresponding effective ergodic theorem holds for x. [ABSTRACT FROM AUTHOR]
- Subjects :
- *INTEGRABLE functions
*ERGODIC theory
*COMPLEXITY (Philosophy)
Subjects
Details
- Language :
- English
- ISSN :
- 14324350
- Volume :
- 67
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- Theory of Computing Systems
- Publication Type :
- Academic Journal
- Accession number :
- 164720321
- Full Text :
- https://doi.org/10.1007/s00224-022-10094-9