Open No More 0 ▲ Computational Complexity 1 hour ago · Science · hide · 0 comments I wrote the post below last week. That was a quaint and quiet time. Last night OpenAI released a treasure trove of 722 manuscripts solving 372 major open problems in mathematics including from theoretical computer science:A proof of the unique games conjecture (formalized in Lean)A full derandomization of randomized log spaceMatrix multiplication in \(n^{2.25+\epsilon}\) time (formalized in Lean)And many many more. I had Claude put together a webpage to make it easier to explore the TCS-related results.Now these proofs haven't been fully verified but if they hold up, we've seen more progress in theoretical computer science in the last 24 hours than in the previous three decades combined!It will take a while to process all these results, and what it means to the field of theoretical computer science and those who work within it. Much more in future posts.A few caveats. As incredibly impressive as this work is, AI isn't solving everything--it solved under 10% of the problems given to… No comments yet. Log in to reply on the Fediverse. Comments will appear here.