Skip to content
Shtetl-Optimized· Scott·Indexed by this site · Originally publishedSelectedAttention40

Dana Moshkovitz's talk: the Unique Games conjecture has been proven (!?)

Talk by Dana Moshkovitz: The Unique Games Conjecture – Proved (!!?)

AI summary

Scott Aaronson announced that Dana Moshkovitz will give a two-hour technical talk at UT Austin on November 4 explaining OpenAI's recently released proof of the Unique Games conjecture, with a Zoom livestream and a video recording to be posted on YouTube. Dana has studied Khot's conjecture since around 2009, and over the past few weeks, while on sabbatical at the Simons Institute in Berkeley, has been studying the proof with Subhash Khot, Johan Håstad, Dor Minzer and others as well as GPT-6 Astra, and has already given two well-received whiteboard talks at the institute this week. The first hour of the talk reviews key ideas in approximation hardness, and the second hour describes the new construction and outlines its soundness analysis.

Why it was selected

OpenAI's proof is not easy for human mathematicians to read; after studying it, Dana Moshkovitz, Khot and others will explain it at UT Austin and release a recording.

Read originalscottaaronson.blog