Title	Computability and uniformity in ergodic theory
Creator	Avigad, Jeremy
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2016-12-05T10:45
Description	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.
Extent	49 minutes
Subject	Mathematics; Mathematical logic and foundations; Dynamical systems and ergodic theory; Logic and foundations
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: Carnegie Mellon University
Series	BIRS Workshop Lecture Videos (Oaxaca de Juárez (Mexico))
Date Available	2017-06-08
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0348160
URI	http://hdl.handle.net/2429/61881
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Faculty
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos