OpenAI and Anthropic claim algorithms that challenge the Exponential Time Hypothesis
What happened
TechCrunch reported on October 28 that OpenAI and Anthropic claim their models found algorithms that solve certain logic problems in sub-exponential time, which could overturn the Exponential Time Hypothesis (ETH). ETH is tied to the P vs NP question, but overturning it would not prove P = NP. The algorithms still await academic review. MIT professor Ryan Williams is organizing a joint review and pushing discussion of research that rests on the assumption.
Written by AI from the coverage · updated 4 hours ago
Coverage
Follow the reports to see the story from different sides.
- TechCrunch · AIPickOpenAI and Anthropic claim to refute the Exponential Time Hypothesis, and computer science is asked to check
OpenAI and Anthropic claim their models found algorithms that solve certain logic problems in sub-exponential time, which could refute the Exponential Time Hypothesis (ETH). ETH is related to P vs NP, but refuting it does not mean P = NP has been proven. MIT professor Ryan Williams is organizing academic review of the algorithms and pushing discussion of research that rests on the assumption.
Heat over time
Heat now 9·Comparable peak 10（Oct 28 02:00）·Comparable change over 24 hours –
The trend only compares accounts observed without gaps, so its range may be smaller than the current heat. Hover or tap the chart for each hour; the left and right arrow keys step through it.