article · KiltHub Repository · 2012

Uncomputably Noisy Ergodic Limits

Avigad, Jeremy

Cited by 0Open access

Abstract

V’yugin has shown that there are a computable shift-invariant measure on 2N and a simple function f such that there is no computable bound on the rate of convergence of the ergodic averages Anf. 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 ε.

Cite this paper

APA 7

Avigad, J. (2012). Uncomputably Noisy Ergodic Limits. KiltHub Repository. https://doi.org/10.1184/r1/6493031

MLA 9

Avigad, Jeremy. “Uncomputably Noisy Ergodic Limits.” KiltHub Repository, 2012, https://doi.org/10.1184/r1/6493031.

Chicago

Avigad, Jeremy. 2012. “Uncomputably Noisy Ergodic Limits.” KiltHub Repository. https://doi.org/10.1184/r1/6493031.

Harvard

Avigad, J. (2012) ‘Uncomputably Noisy Ergodic Limits’, KiltHub Repository. Available at: https://doi.org/10.1184/r1/6493031.

BibTeX

@article{avigad2012uncomputably,
  title = {{Uncomputably Noisy Ergodic Limits}},
  author = {Avigad, Jeremy},
  journal = {KiltHub Repository},
  year = {2012},
  doi = {10.1184/r1/6493031}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.