Did AI Prove the Unique Games Conjecture?
Ankur Moitra says a headlining result in the OpenAI drop is that the unique games conjecture is true. He had been on the side of the doubters, because the conjecture sounded too nice to be true.
Unique games strengthens the PCP theorem from the 1990s, a result that made the front page of the New York Times. A verifier can catch a false proof by inspecting only a constant number of random spots. If unique games holds, a huge set of problems has a best approximation algorithm, and that algorithm is simple.
Dor Minzer and Irit Dinur proved a weaker two-to-one games theorem that looked like a path humans might finish in another 10 or 20 years. The OpenAI release showed the full conjecture is true.
#503 – AI Crisis in Math: Navier-Stokes, Riemann Hypothesis & Complexity Theory ·