What's up in
After 44 years, there’s finally a better way to find approximate solutions to the notoriously difficult traveling salesperson problem.
Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory.
A powerful technique called SAT solving could work on the notorious Collatz conjecture. But it’s a long shot.
Computer scientists established a new boundary on computationally verifiable knowledge. In doing so, they solved major open problems in quantum mechanics and pure mathematics.
By ignoring their goals, evolutionary algorithms have solved longstanding challenges in artificial intelligence.