I believe P=NP – Thoughts
The only things that matter in a theoretical study are those that you can prove, but it’s always fun to speculate. After worrying about P vs. NP for half my life, and having carefully reviewed the …
The only things that matter in a theoretical study are those that you can prove, but it’s always fun to speculate. After worrying about P vs. NP for half my life, and having carefully reviewed the available “evidence” I have decided I believe that P = NP. A main justification for my belief is history: In the 1950’s Kolmogorov conjectured that multiplication of -bit integers requires time . That’s the time it takes to multiply using the method that mankind has used for at least six millennia. Presumably, if a better method existed it would have been found already. Kolmogorov subsequently…
saved by
related reading
- Reasons to believescottaaronson.blog
- Possible future Polymath projects | Gowers's Webloggowers.wordpress.com
- Total Search @ STOC 2025sites.google.com
- Artur`s homepage | Artur Riazanovtunyash.github.io
- P versus NP problem - Wikipediaen.wikipedia.org
- 1404.5236 Sum-of-Squares Proofs and the Quest toward Optimal Algorithmsarxiv.org
- pnp.pdfscottaaronson.com
- Shtetl-Optimized >> Blog Archive >> Ten Signs a Claimed Mathematical Breakthrough is Wrongscottaaronson.blog
- P vs. NP for Dummiesscottaaronson.blog
- Computational Complexity Theory (Stanford Encyclopedia of Philosophy)plato.stanford.edu
- P vs NP and its application to zero knowledge proofs | RareSkillsrareskills.io
- Complexity Theory’s 50-Year Journey to the Limits of Knowledge | Quanta Magazinequantamagazine.org