OpenAI Says Its AI Model Disproved a Key Computing Hypothesis

Photo: TokenPost
OpenAI says an internal model disproved the Exponential Time Hypothesis, a central assumption in computational complexity, and a group of outside researchers will review the claimed result. The hypothesis has served as a premise about computational difficulty in hundreds of research papers. OpenAI said the result passed formal verification in Lean. The review team will be led by Russell Impagliazzo and Ramamohan Paturi, who proposed the hypothesis, and MIT professor Ryan Williams. OpenAI also said the model proved the local smoothing conjecture in arbitrary dimensions, resolving both the Kakeya conjecture and the Stein restriction conjecture.
Source: TokenPost







