Explore >> Select a destination

You are here

 www.scientificamerican.com
The Limits of Quantum Computers | Scientific American
| | cacm.acm.org
Fifty Years of P vs. NP and the Possibility of the Impossible Communications of the ACM
3.0 parsecs away

Travel
| | [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.livescience.com
Quantum computing will make cryptography obsolete. But computer scientists are working to make them unhackable. | Live Science
3.1 parsecs away

Travel
| | When quantum computers become commonplace, current cryptographic systems will become obsolete. Scientists are racing to get ahead of the problem and keep our data secure.
| | thetexasorator.com
An Interview with Dr. Scott Aaronson - The Texas Orator
3.5 parsecs away

Travel
| | An interview with UT computer scientist and OpenAI researcher Scott Aaronson.
| | blog.cryptographyengineering.com
It's the end of the world as we know it (and I feel fine) - A Few Thoughts on Cryptographic Engineering
30.3 parsecs away

Travel
| Unitards: another consequence ofquantum computing. Back in December I asked readers for some topics they were particularly keen to read about on this blog. One of the best (and sadly, most challenging) suggestions was to say something about post-quantum cryptography. Roughly speaking, this term describes the future of cryptographyafter quantum computers arrive and screw things...