AI refutes 30-year-old mathematical assumption in computer science

Superpolynomial subexponential runtimes. / Even though in practice it would take you several lifetimes, / If you ran it long enough you'd always find those two primes. / Superpolynomial subexponential runtimes -- Eric Hughes (2000)

Discussion (771 points, 22 hours ago, 278 comments) https://news.ycombinator.com/item?id=50251661