← Back to updates

Discovery

The Mathocalypse

Summary

The Mathocalypse Last night my 9-year-old son was taunting my wife, complexity theorist Dana Moshkovitz, as follows: “mommy, I heard you got cooked! I heard that a robot solved the math problem you worked on for your whole career! OOF!” While my son was being a brat, he also wasn’t wrong. Whether you’re thrilled, depressed, angry, or whatever else about it, yesterday was surely one of the biggest days in mathematical history. And yes, among the 372 huge results released yesterday by OpenAI, on the recommendation of its advisory group of Timothy Gowers, Edward Witten, and other distinguished mathematicians, was a proof of Subhash Khot’s Unique Games Conjecture (UGC), a statement that my wife has worked toward proving for the entire time I’ve known her. (The UGC implies that a whole slew of optimization problems really are NP-hard, even if you just want an approximation that’s slightly better than what you get from semidefinite programming relaxation, which is one of our main tools.) Or at least, we’re pretty sure that it’s a proof! There’s a Lean certificate, as there are for some of the other 372 breakthrough results (not all of them). But it also appears that no human has understood just about any of these proofs yet; the race to do so has just started. If you want an on-the-ground sense of what that race is going to be like, here’s some of what Dana texted me last night: It feels like something written by someone who’s on psychedelics. So much unclear and doesn’t make sense. Lots of name dropping of previous work without discussing why it can be used despite impossibility results Basically the paper is so horribly written that it’s impossible to read it without AI help I asked Astra for reasonable completeness and soundness claims of the noise gadget and it gave them by combining claims from all over the paper They also have direct optimal NP hardness of approximation proofs for the main applications of the UGC (Max Cut and all CSP) that bypass the UGC. The UGC proof invents a completely new bizarre code with a noise test. It’s some crazy recursive construction. It’s not the long code, not the short code – some alien craziness I still think that there maybe is a proof that uses the half space code (which is natural) The citations are often irrelevant and confusing A possible future is a math world that’s heavenly if you have vision/creative ideas that AI…

Evidence & checks

Discovery channel
外部发现 · Hacker News 首页
Original material
scottaaronson.blog
Material type
Source page; material type not verified
Material basis
Source excerpt
Review status
No human-review record