Complexity Theory’s 50-Year Journey to the Limits of Knowledge | Quanta Magazine
How hard is it to prove that problems are hard to solve? Meta-complexity theorists have been asking questions like this for decades. A string of recent results has started to deliver answers.
Complexity Theory’s 50-Year Journey to the Limits of Knowledge | Quanta Magazine Home Complexity Theory’s 50-Year Journey to the Limits of Knowledge Read Later Share Copied! Comments Read Later Read Later computational complexity Complexity Theory’s 50-Year Journey to the Limits of Knowledge By Ben Brubaker August 17, 2023 How hard is it to prove that problems are hard to solve? Meta-complexity theorists have been asking questions like this for decades. A string of recent results has started to deliver answers. Read Later Complexity theorists are confronting their most puzzling problem ye
related reading
- P versus NP problem - Wikipediaen.wikipedia.org
- pnp.pdfscottaaronson.com
- Computational Complexity Theory (Stanford Encyclopedia of Philosophy)plato.stanford.edu
- Impagliazzo's Five Worldsblog.computationalcomplexity.org
- Reasons to believescottaaronson.blog
- Complexity class - Wikipediaen.wikipedia.org
- Computational Complexityblog.computationalcomplexity.org
- NP-completeness - Wikipediaen.wikipedia.org
- Shtetl-Optimized >> Blog Archive >> Ten Signs a Claimed Mathematical Breakthrough is Wrongscottaaronson.blog
- I believe P=NPemanueleviola.wordpress.com
- P vs. NP for Dummiesscottaaronson.blog
- aaronson-philosophy.pdfcs.princeton.edu