Uncomputably noisy ergodic limits

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.

Cited by in corpus (2)

• Computability and analysis: the legacy of Alan Turing
• Oscillation and the mean ergodic theorem for uniformly convex Banach spaces