factual

NP-Complete Problems Can Encode Profound Difficulties

Because NP-complete problems are universal, one can encode enormities into them — designing millions of boxes that fit into a car trunk if and only if there is a short proof of the Riemann hypothesis, or such that fitting them requires breaking a cryptographic code — which is why an easy intuition that real-world NP-complete instances are easy is misleading: if P equaled NP you could mine billions of dollars of Bitcoin or compress all of Wikipedia optimally, which would require deeply understanding human knowledge.

factualpending

Speaker

Scott Aaronson

Evidence Quote

“the point of a problem being NP-complete is that you can encode these enormities into it, like finding a proof of the Riemann hypothesis, like mining billions of dollars of Bitcoin, and so forth, anything for which an answer could be easily checked”

Source

99 | Scott Aaronson on Complexity, Computation, and Quantum Gravity— Sean Carroll's Mindscape
Created: 6/13/2026, 12:26:25 AM

Your notes

Loading notes...