OpenAI’s biggest claim yet gets guarded welcome after Erdős, Navier-Stokes and a sign error

The scientists that OpenAI has appointed to verify its latest claim that one of its internal models has successfully refuted the Exponential Time Hypothesis have declined to endorse the claim, pointing to past drama around the AI lab’s math announcements, which they say tend to be exaggerated. The Exponential Time Hypothesis, which the Altman-led lab claims to have cracked , is a measure of the difficulty of solving the Boolean satisfiability, a problem tied to the P versus NP question and a conjecture that underpins hundreds of computer science papers. MIT’s Ryan Williams and Russell Impagliazzo and Ramamohan Paturi from UC San Diego will lead the group responsible for independently verifying the results on the hypothesis originally proposed by Impagliazzo and Paturi, along with Francis Zane.

BeCrypto News shows a short excerpt and links to the publisher. The full report belongs to Cryptopolitan.