Computational complexity

1 articles
  • Scott Aaronson

    What if Solving Math Problems Were as Easy as Checking Solutions?

    If you think computers have gotten really good at solving problems—like voice recognition, or self-driving cars—then your mind would be blown by what they could do if P = NP.Internet cryptography would come crashing down. Voice and image recognition would become near-perfect. Mathematical proofs would be greatly simplified. The stock market would dramatically change. Nautilus […]