/explore
|
You are here 
|
scottaaronson.blog | ||
| | | | |
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. |
|
| | | | | ||
| | | | |
windowsontheory.org
(see also pdf version) Quantum computing is one of the most exciting developments of computer science in the last decades. But this concept is not without its critics, often known as "quantum computing skeptics" or "skeptics" for short. The debate on quantum computing can sometimes confuse the physical and mathematical aspects of this question,... |
|
| | | | | ||
| | | | |
rjlipton.com
Are quantum errors incorrigible? Discussion between Gil Kalai and Aram Harrow Gil Kalai and Aram Harrow are world experts on mathematical frameworks for quantum computation. They hold opposing opinions on whether or not quantum computers are possible. Today and in at least one succeeding post, Gil and Aram will discuss the possibility of building large-scale... |
|
| | | | | ||
| | | | |
quantumfrontiers.com
There's a famous parable about a group of blind men encountering an elephant for the very first time. The first blind man, who had his hand on the elephant's side, said that it was like an enormous wall. The second blind man, wrapping his arms around the elephant's leg, exclaimed that surely it was a... |
|
| | | |||
