Article

Uncomputably noisy ergodic limits

Notre Dame Journal of Formal Logic (Impact Factor: 0.43). 05/2011; DOI: 10.1215/00294527-1716757
Source: arXiv

ABSTRACT V'yugin has shown that there are a computable shift-invariant measure on
Cantor space and a simple function f such that there is no computable bound on
the rate of convergence of the ergodic averages A_n f. Here it is shown that in
fact one can construct an example with the property that there is no computable
bound on the complexity of the limit; that is, there is no computable bound on
how complex a simple function needs to be to approximate the limit to within a
given epsilon.

0 Bookmarks
 · 
53 Views

Full-text

View
0 Downloads
Available from