Explore >> Select a destination
|
You are here 
|
scottaaronson.blog | ||
| | | | |
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... | |
| | | | |
thetexasorator.com
|
|
| | | | | An interview with UT computer scientist and OpenAI researcher Scott Aaronson. | |
| | | | |
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. | |
| | | | |
www.alignmentforum.org
|
|
| | | Preface The following text is my submission for theAI Safety Public Materials contest. In it, I try to lay out the importance of AI Safety Research... | ||
