BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:IC Colloquium: The Value of Errors in Proofs
DTSTART:20221110T161500
DTEND:20221110T173000
DTSTAMP:20260407T065917Z
UID:14a277117c54847156d8a0927d2290dfce2081616aa31b3a31f3fb13
CATEGORIES:Conferences - Seminars
DESCRIPTION:By: Avi Wigderson - School of Mathematics at the Institute for
  Advanced Study - Princeton University\nVideo of his talk\n\nAbstract\nA f
 ew months ago\, a group of theoretical computer scientists posted a paper 
 on the Arxiv with the strange-looking title "MIP* = RE"\, surprising and i
 mpacting not only complexity theory but also some areas of math and physic
 s. Specifically\,  it resolved\, in the negative\, the "Connes' embedding
  conjecture" in the area of von-Neumann algebras\, and the "Tsirelson prob
 lem" in quantum information theory. It further connects Turing's seminal 1
 936 paper which defined algorithms to Einstein's 1935 paper with Podolsky 
 and Rosen which challenged quantum mechanics.\nYou can find the paper here
  https://arxiv.org/abs/2001.04383\n\nAs it happens\, both acronyms MIP* a
 nd RE represent proof systems\, of a very different nature. To explain the
 m\, we'll take a meandering journey \nthrough the classical and modern de
 finitions of proof. I hope to explain how the methodology of computationa
 l complexity theory\, especially \nmodeling and classification (of both p
 roblems and proofs) by algorithmic efficiency\, naturally leads to the gen
 aration of new such notions and \nresults (and more acronyms\, like NP). 
 A special focus will be on notions of proof which allow interaction\, rand
 omness\, and errors\, and their \nsurprising power and magical properties
 .\n\nThe talk does not require special mathematical background.\n\nBio\nAv
 i Wigderson is a Professor in the School of Mathematics at the Institute f
 or Advanced Study since 1999\, where he leads the Institute's Computer Sci
 ence and Discrete Math Program. He received his PhD in computer science in
  1983 from Princeton University. During 1986-2001 he has held a permanent 
 position at the Hebrew University Computer Science Institute\, where he wa
 s the chair from 1992-95. Avi has held visiting positions at the Universit
 y of California\, Berkeley\, IBM Research\, the Mathematical Sciences Rese
 arch Institute\, Princeton University and the Institute for Advanced Study
 . His honors include being a two-time invited speaker at the International
  Congress of Mathematicians\, where he was also presented in 1994 with the
  Nevanlinna Prize for outstanding contributions in mathematical aspects of
  information sciences. Avi gave the AMS Gibbs Lectures and received the AM
 S Conant Prize for mathematical exposition in 2008. He was the recipient o
 f the 2009 Gödel Prize\, which recognizes outstanding papers in theoretic
 al computer science. In 2011 Avi was elected to the American Academy of Ar
 ts and Sciences\, and in 2013 he was elected to the National Academy of Sc
 iences.\n\nMore information\n 
LOCATION:BC 420 https://plan.epfl.ch/?room==BC%20420 https://epfl.zoom.us/
 j/64215051796?pwd=MEJ1Q2JGYTBidkpUSnlya2hkeFpGZz09
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR