OpenAI Claims It Just Did The Impossible
OpenAI claims to have broken the exponential time hypothesis for 3-SAT problems
“I did not think this would happen in my lifetime.”
OpenAI reportedly claims to have solved or significantly advanced the three satisfiability (3-SAT) problem, a decades-old computational complexity challenge that was considered practically unsolvable within the exponential time hypothesis. The video from Two Minute Papers frames this as a landmark moment in computer science, though the content is cut off before full technical details are provided. If verified, this would represent a foundational breakthrough in computational theory with broad implications for AI and cryptography.