BIRS Workshop Lecture Videos

Banff International Research Station Logo

BIRS Workshop Lecture Videos

Computability and uniformity in ergodic theory Avigad, Jeremy


Countless theorems of analysis assert the convergence of sequences of numbers, functions, or elements of an abstract space. Classical proofs often establish such results without providing explicit rates of convergence, and, in fact, it is often impossible to compute the limiting object or a rate of convergence from the given data. This results in the curious situation that a theorem may tell us that a sequence converges, but we have no way of knowing how fast it converges, or what it converges to.

Item Media

Item Citations and Data


Attribution-NonCommercial-NoDerivatives 4.0 International