/explore
|
You are here 
|
windowsontheory.org | ||
| | | | |
cacm.acm.org
|
|
| | | | | [AI summary] The article discusses the ongoing evolution of the P vs NP problem in computational complexity theory, emphasizing its profound implications for algorithm design, cryptography, and artificial intelligence. It highlights how advances in machine learning and quantum computing are reshaping our understanding of computational limits, while also cautioning against the potential misuse of algorithms in areas like algorithmic bias and surveillance. The piece concludes by reflecting on the philosophical and practical significance of P vs NP, suggesting that its resolution could redefine the boundaries of what is computationally feasible. | |
| | | | |
scottaaronson.blog
|
|
| | | | | The following is the lightly-edited transcript of a talk that I gave a week ago, on Wednesday October 5, at Avi Wigderson's 60th birthday conference at the Institute for Advanced Study in Princeton. Videos of all the talks (including mine) are now available here. Thanks so much to Sanjeev Arora, Boaz Barak, Ran Raz, Peter... | |
| | | | |
rjlipton.com
|
|
| | | | | Algorithms with huge running times David Johnson is a renown computer theorist who was awarded the 2009 Knuth Prize, for his seminal contributions to theory. He is famous for: his many great papers on various aspects of algorithmic theory, his classic book ``Computers and Intractability: A Guide to the Theory of NP-Completeness" with Mike Garey,... | |
| | | | |
notes.kateva.org
|
|
| | | A personal blog of diverse opinions. | ||
