OpenAI's AI Just Refuted a Core Assumption of Computer Science
A.I. Just Blew Up a Key Tenet of Computer Science

A long-held conjecture called the exponential time hypothesis, proposed in 1998 by Russell Impagliazzo and colleagues, held that certain problems must always be hard for computers to solve quickly. On Oct. 26, OpenAI announced its newest AI technology had refuted that conjecture, casting doubt on the intuition behind the million-dollar P vs. NP question and raising the possibility of radical new efficiencies. The broader P vs. NP problem remains unsolved.
Common sense says that checking solutions should be much easier than finding solutions. If P and NP follow intuition, then they should definitely not be equal.
- fsmv
Old news and the ETH proof has literally no implications for P vs NP or anything else even remotely practical
- peri-cl
Also
https://news.ycombinator.com/item?id=50251661 ("The Exponential Time Hypothesis Is False [pdf] (github.com/openai)", 309 comments)
- matt3210
IPO bait