Artificial Intelligence1 min read

A.I. Just Blew Up a Key Tenet of Computer Science

By · Published by Everything Blog

In short

OpenAI announced the refutation of the foundational computer science conjecture on Oct. 26, with competitor Anthropic shortly following with its own claim. The finding upends longstanding mathematical beliefs that certain hard problems cannot be resolved quickly by showing machines might solve them as fast as verifying them. This milestone was among nearly 400 scientific findings recently published by competing artificial intelligence developers. Although it carries no immediate real-world effect, experts view the machine-led discovery as a major disruption to theoretical computer science.

Key points

  • Disproving the hypothesis indicates machines could theoretically solve complex puzzles as…: Disproving the hypothesis indicates machines could theoretically solve complex puzzles as rapidly as they verify existing solutions.
  • The theoretical breakthrough could eventually transform fields such as encryption crackin…: The theoretical breakthrough could eventually transform fields such as encryption cracking, circuit optimization, and drug discovery.
  • Experts were shocked both by the disruption of computational limits and because machines…: Experts were shocked both by the disruption of computational limits and because machines generated the discovery instead of humans.

Sources checked by our analysis pipeline: 1

How A.I. Just Blew Up a Key Tenet of Computer Science

A longstanding hypothesis held that some problems would always be hard for computers to solve quickly. But OpenAI disproved it — raising the possibility of radical new efficiencies.

To understand the latest shocking development in A.I.-generated math, it helps to think about Sudoku.

Solving one of those nine-box number puzzles, especially at the highest difficulty levels, can be fiendishly time-consuming. But once you have a solution, it’s easy to double-check that you got it right: Just scan each row, column and box and confirm that each integer appears exactly once.

It’s an analogy that Russell Impagliazzo, a professor of computer science at the University of California, San Diego, invokes to explain a high-profile math question called “P vs. NP.” For years, Dr. Impagliazzo explains, he and other computer scientists have assumed that math and computer science obey that apparent truth about Sudoku: Solving a problem is much, much harder than checking that a solution is correct.

Sitting at the intersection of mathematics and theoretical computer science, “P vs. NP”…

Artificial Intelligence