BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//jEvents 2.0 for Joomla//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:STANDARD
DTSTART:20251102T010000
RDATE:20260308T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20261101T010000
RDATE:20270314T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20271107T010000
RDATE:20280312T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20281105T010000
RDATE:20290311T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20250331T104500
RDATE:20251102T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20260308T030000
RDATE:20261101T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20270314T030000
RDATE:20271107T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20280312T030000
RDATE:20281105T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:453c646898a11b7bbe862b6c99861218
CATEGORIES:Mathematical Physics Seminar
CREATED:20260323T015556
SUMMARY:Webinar: Avi Wigderson - The Value of Errors in Proofs
LOCATION:Zoom
DESCRIPTION:<p style="text-align: center;"><strong>Avi Wigderson - IAS</strong></p><p s
 tyle="text-align: center;"><strong>Wednesday,&nbsp;April 1,&nbsp;2026</stro
 ng></p><p style="text-align: center;"><strong>Zoom opens: 10:30AM EDT</stro
 ng></p><p style="text-align: center;"><strong>Seminar begins: 10:45AM EDT</
 strong></p><p style="text-align: center;"><strong>The Value of Errors in Pr
 oofs</strong></p><p style="text-align: center;"><strong>(a fascinating jour
 ney from Turing’s 1936 R != RE to the 2020 breakthrough of MIP* = RE )</str
 ong></p><p>In the year 2020, a group of theoretical computer scientists pos
 ted a paper on the Arxiv with the strange-looking title "MIP* = RE", impact
 ing and surprising not only complexity theory but also some areas of math a
 nd physics. Specifically, it resolved several long-standing problems in the
 se areas.</p><p>You can find the paper here: <a href="https://arxiv.org/abs
 /2001.04383">https://arxiv.org/abs/2001.04383</a>&nbsp;</p><p>As it happens
 , both acronyms MIP* and RE represent proof systems, of a very different na
 ture. To explain them, we'll take a meandering journey through the classica
 l and modern definitions of proof. I hope to explain how the methodology of
  computational complexity theory, especially modeling and classification (b
 oth 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, randomne
 ss, and errors, and their surprising power and magical properties.&nbsp;</p
 ><p>This talk requires no special mathematical background.</p>
DTSTAMP:20260827T220207
DTSTART;TZID=America/New_York:20260401T104500
DTEND;TZID=America/New_York:20260401T120000
SEQUENCE:0
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR