OpenAI just did the impossible...
OpenAI says its AI has disproved the Exponential Time Hypothesis, challenging a barrier that shaped decades of computer science. Could there be shortcuts through problems we thought were impossibly hard? We unpack the connection to P versus NP, what a practical breakthrough could mean for encryption and AI, and the idea of a “cheat code” to the universe. ______________________________________________ My Links 🔗 ➡️ Twitter: https://x.com/WesRothMoney ➡️ AI Newsletter: https://natural20.beehiiv.com/subscribe Want to work with me? Brand, sponsorship & business inquiries: wesroth@smoothmedia.co ______________________________________________ SOURCES: OpenAI’s announcement: https://openai.com/index/building-scientific-understanding-with-academic-communities/ Scott Aaronson on P versus NP: https://www.scottaaronson.com/papers/pnp.pdf The P versus NP Millennium Prize problem: https://www.claymath.org/millennium/p-vs-np/ OpenAI’s ETH proof documentation: https://github.com/openai/math/blob/main/lean/docs/378.md Emanuele Viola: “I believe P=NP”: https://emanueleviola.wordpress.com/2018/02/16/i-believe-pnp/ Yang–Mills existence and mass gap: https://www.claymath.org/millennium/yang-mills-the-maths-gap/ OpenAI’s local smoothing and Kakeya documentation: https://github.com/openai/math/blob/main/lean/docs/079.md CHAPTERS: 00:00 OpenAI’s Announcement 06:20 P Versus NP 12:35 Exponential Time Hypothesis 14:05 AI and Mathematicians 18:10 The Mountain Analogy 22:00 Computing’s Cheat Code 24:30 Constants and Simulations 27:25 Viola and Physics #openai #ai #science
