AI refutes 30-year-old mathematical assumption in computer science

OpenAI claims its AI models have disproven the exponential time hypothesis, a nearly 30-year-old assumption underpinning much of computer science, by devising an algorithm that beats the previously assumed speed limit for solving logical puzzles. The result, announced on 26 October alongside claimed breakthroughs in mathematics and physics, was verified using the Lean proof-checking software and has been sent to an independent group including ETH's original proposers. Researchers say if confirmed it would require a complete revision of several areas of algorithms and complexity, though it does not directly resolve the P versus NP problem.