Skip to content (access key 's')
Logo of Technion
Logo of CS Department
Logo of CS4People
Events

The Taub Faculty of Computer Science Events and Talks

CS Special Guest Lecture: The Value of Errors in Proofs
event speaker icon
Avi Wigderson (IAS Princeton)
event date icon
Monday, 12.06.2023, 14:30
event location icon
Room 337 taub bld.
CS Special Guest Lecture by Prof. Avi Wigderson, IAS Princeton, on the Occasion of his Being Awarded an Honorary Doctorate from the Technion Recently, a group of theoretical computer scientists posted a paper on the Arxiv with the strange-looking title "MIP* = RE", surprising and impacting 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. It further connects Turing's seminal 1936 paper which defined algorithms to Einstein's 1935 paper with Podolsky and Rosen which challenged quantum mechanics. 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 modelling and classification (of 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. The talk does not require special mathematical background.
CS Special Guest Lecture: The Value of Errors in Proofs