[Dottorcomp] Fwd: REMINDER: Mathematics Colloquium of Milano - WIGDERSON - Aprile 3, 2025

[Luca Rondi]

Segnalo il seguente seminario che si terrà a Milano giovedì.

Cordiali saluti,
Luca

> Begin forwarded message:
> 
> From: Kevin Ray Payne <kevin.payne a unimi.it>
> Subject: REMINDER: Mathematics Colloquium of Milano - WIGDERSON - Aprile 3, 2025
> Date: 1 April 2025 at 10:22:40 CEST
> To: Daniele Cassani <daniele.cassani a uninsubria.it>, "loic.grenie a unibg.it" <loic.grenie a unibg.it>, Luca Rondi <luca.rondi a unipv.it>
> 
> MATHEMATICS Colloquium of MILANO
> Thursday April 3, 2025 at 16.30 in Aula C03 of the Università degli Studi di Milano, located in Via Mangiagalli 25, 
> AVI WIGDERSON
> Institute for Advanced Study, Princeton
> will present the inaugural colloquium entitled
> The Value of Errors in Proofs
> – the fascinating journey from Turing’s 1936 R ≠ RE to the 2020 breakthrough of MIP* = RE
> 
> ABSTRACT: In the year 2020, a group of theoretical computer scientists posted a paper on the arXiv with the strange-looking title "MIP* = RE", impacting and surprising not only complexity theory but also some areas of math and physics. Specifically, it resolved, in the negative, the "Connes' embedding conjecture" in the area of von-Neumann algebras, and the "Tsirelson problem" in quantum information theory. You can find the paper here: https://arxiv.org/abs/2001.04383 <https://arxiv.org/abs/2001.04383> 
> 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 (both problems and proofs) by algorithmic efficiency, naturally leads to the generation 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.
> This talk requires no special background.
>  
> RECEPTION: Following the colloquium, there will be a reception in Via Mangiagalli 25. Those who intend to attend the reception are asked to register at the website https://www.mathcm.it <https://www.mathcm.it/>.  (In case of inclement weather, the number of participants is limited to 100 persons).
> ABOUT THE SPEAKER: Avi Wigderson is justifiably credited with deepening the connections between mathematics and theoretical computer science. First and foremost, it is difficult to overestimate the impact of Wigderson ‘s work in the field ofcomputational complexity, the branch of theoretical computer science concerned with the efficiency of algorithms. He has conducted research on every major open problem in this field and in some real sense the field has grown around him. One key aspect of this work concerns the role of randomness in algorithms, and Wigderson (with collaborators N. Nisan and R. Impagliazza) have shown that for every fast random algorithm (involving coin flips that can introduce errors), under natural conditions, there exists a deterministic algorithm that is almost as fast.
> Wigderson has also given fundamental contributions to applications of internet security through his study of zero knowledge proofs, which concern proofs of a claim which furnish no additional information than the validity of the claim. In addition, Widgerson’s work on the zig-zag product has shown deep connections between computational complexity, graph theory and group theory and has become a widely used tool in cryptography. Wigderson’s fundamental and lasting contributions have been recognized in the awarding of numerous prizes and awards, including the Nevanlinna Prize (1994), Gödel Prize (2009), Knuth Prize (2019), Abel Prize (2021) and the Turing Award (2023)
> Wigderson received his Ph.D in Computer Science at Princeton University in 1983 under the direction of Richard Lipton with a dissertation entitled “Studies in Computational Complexity”.  Following three temporary positions at distinguished institutions, Wigderson joined the faculty of Hebrew University in 1986, rising to Full Professor in 1991. And in 1999 accepted a joint appointment at the Institute for Advanced Study, Princeton.  As of 2003, this is full time appointment and Wigderson is currently the Herbert H. Maass Professor in the School of Mathematics of the IAS, Princeton.
> ORGANIZATION:
> Dipartimento di Matematica "F. Enriques", Università degli Studi di Milano
> Dipartimento di Matematica, Politecnico di Milano
> Dipartimento di Matematica e Applicazioni, Università di Milano Bicocca
> Dipartimento di Scienze delle Decisioni, Università Bocconi Milano
>  
> In collaboration with: SEMINARIO MATEMATICO E FISICO DI MILANO
> DETAILS & CONTACTS: visit the website of the MCM at https://www.mathcm.it <https://www.mathcm.it/> or write to one of the organizers:
> fabrizio.andreatta a unimi.it <mailto:fabrizio.andreatta a unimi.it>
> giovanni.catino a polimi.it <mailto:giovanni.catino a polimi.it>
> fabio.cipriani a polimi.it <mailto:fabio.cipriani a polimi.it>
> gregorio.falqui a unimib.it <mailto:gregorio.falqui a unimib.it>
> vincenzo.marra a unimi.it <mailto:vincenzo.marra a unimi.it>
> kevin.payne a unimi.it <mailto:kevin.payne a unimi.it>
> giuseppe.savare a unibocconi.it <mailto:giuseppe.savare a unibocconi.it>
> thomas.weigel a unimib.it <mailto:thomas.weigel a unimib.it>
>  
> On behalf of the organizers,
> Kevin Payne