OpenAI’s Exponential Time Hypothesis Claim: What Experts Are Saying

OpenAI said it had punctured the Exponential Time Hypothesis, or ETH, described as a nearly 30-year-old belief that some logic problems become overwhelmingly time-consuming as they grow. Hours later, Anthropic released its own research refuting ETH. OpenAI said it asked outside computer scientists to organize an open review of its claim, while the researchers have emphasized that their involvement is not an endorsement.

If the AI labs’ announcements hold, they could reopen the search for more capable algorithms in an area where computer scientists had largely assumed progress was limited. Ryan Williams, one of the independent algorithm design experts reviewing OpenAI’s claims, has not certified the result but said the claimed breakthrough could lead to “faster algorithms.” The discussion also touches P = NP, though John D. Cook wrote that “the status of P = NP is still unknown.”

Williams wrote that, if OpenAI’s claim is true, it should make computer scientists put more weight on the possibility of P = NP. Gary Marcus called it “a big deal if correct,” while Cook said the claims were impressive but did not answer computer science’s biggest open question. Joshua Fonseca Rivera framed the claim as a reminder that humans may have underestimated computer intelligence, and Timothy Gowers called the development “very surprising and consequential.”

The most important detail for readers is that OpenAI’s claim is still being examined, and outside participation does not equal validation. The potential implications are large, but the article makes clear that the results have not been certified by the independent experts cited. For now, the story is less about a settled conclusion and more about whether the announced research survives scrutiny.