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:20201101T010000
RDATE:20210314T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20211107T010000
RDATE:20220313T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20221106T010000
RDATE:20230312T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20231105T010000
RDATE:20240310T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20241103T010000
RDATE:20250309T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
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:20200608T104500
RDATE:20201101T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20210314T030000
RDATE:20211107T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20220313T030000
RDATE:20221106T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20230312T030000
RDATE:20231105T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20240310T030000
RDATE:20241103T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20250309T030000
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:64bce977385b056f0fd33a41dfb6e774
CATEGORIES:Mathematical Physics Seminar
CREATED:20210524T112614
SUMMARY:The Value of Errors in Proofs   -  a fascinating journey from  Turing's seminal 1936 R ?\neq RE to the 2020 breakthrough of MIP* = RE 
LOCATION:zoom
DESCRIPTION:<p><strong style="background-color: inherit; color: inherit; font-family: i
 nherit; font-size: 1rem;">Abstract</strong>: Last year, a group of theoreti
 cal computer scientists posted a paper on the Arxiv with the strange-lookin
 g title "MIP* = RE", impacting and surprising not only complexity theory bu
 t also some areas of math and physics. Specifically, it resolved, in the ne
 gative, the "Connes' embedding conjecture" in the area of von-Neumann algeb
 ras, and the "Tsirelson problem" in quantum information theory. You can fin
 d the paper here <a href="https://nam02.safelinks.protection.outlook.com/?u
 rl=https%3A%2F%2Farxiv.org%2Fabs%2F2001.04383&amp;data=04%7C01%7Cavishag.kl
 atzkin%40math.rutgers.edu%7C214fd0f08f844840f2ab08d91e548754%7Cb92d2b234d35
 447093ff69aca6632ffe%7C1%7C0%7C637574170655277473%7CUnknown%7CTWFpbGZsb3d8e
 yJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%3D%7C1000&am
 p;sdata=%2FVZZe66kVvYbzhilAOHd8Y6UbeLFOq0D%2BHTNlpdsQzM%3D&amp;reserved=0" 
 style="background-color: inherit; font-family: inherit; font-size: 1rem;" m
 oz-do-not-send="true"></a><a href="https://arxiv.org/abs/2001.04383">https:
 //arxiv.org/abs/2001.04383</a></p><p>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 no
 tions 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.</p><p>The talk does not assume an
 y special background.</p>
CONTACT:Avi Wigderson, Institute for Advanced Study, Princeton
DTSTAMP:20260822T065654
DTSTART;TZID=America/New_York:20210609T104500
DTEND;TZID=America/New_York:20210609T114500
SEQUENCE:0
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR