The Abel lectures: László Lovász and Avi Wigderson

Показать описание

0:30 Introduction by the Abel Prize Committee Chair, Hans Munthe-Kaas
02:42 László Lovász: Continuous limits of finite structures
49:27 Questions and answers
1:00:31 Avi Wigderson: The Value of Errors in Proofs
1:41:24 Questions and answers
1:50:20 Final remarks by John Grue, Chair of the Abel Board

László Lovász - Continuous limits of finite structures
The idea that a sequence of larger and larger finite structures tends to a limit has been around for quite a while, going back (at least) to John von Neumann's "continuous geometries".

After a brief survey of the history of such constructions, we turn to limits of graph sequences; this theory was worked out for dense graphs and bounded-degree graphs more than a decade ago. The "intermediate" cases (for example, the sequence of hypercubes, or incidence graphs of finite geometries) represent much more difficult problems, and only partial results can be reported. Perhaps surprisingly, the limit objects, whenever known, are best described as Markov chains on measurable spaces.

Why are we making such efforts to construct such limit objects? The talk will show a couple of examples of interesting graph-theoretic problems where graph limits are needed even for the precise statement of the problem, or as the starting point of the solution.

Avi Wigderson - The Value of Errors in Proofs

As it happens, both acronyms MIP* and RE represent proof systems, of a very different nature. To explain them, we'll take a meandering journey through the classical and modern definitions of proof. I hope to explain how the methodology of computational complexity theory, especially modeling and classification (of both problems and proofs) by algorithmic efficiency, naturally leads to the genaration of new such notions and results (and more acronyms, like NP). A special focus will be on notions of proof which allow interaction, randomness, and errors, and their surprising power and magical properties.