Search results
Scott Aaronson. I'm Schlumberger Centennial Chair of Computer Science at The University of Texas at Austin, and director of its Quantum Information Center. My research interests center around the capabilities and limits of quantum computers, and computational complexity theory more generally.
- Talks
Talks. Important Note: Use these slides at your own risk!...
- Papers
Research Papers and Surveys
- FAQ
Q: Dr. Aaronson, while your writings are of some interest,...
- PhD Thesis
PhD thesis of Scott Aaronson Filed in Fall 2004. 258 pages,...
- Cs378 Introduction to Quantum Information Science
Scott Aaronson. TAs: Patrick Rall and Corey Ostrove UT...
- Phys771 Lecture 9
Scott: Yes, it is. My contention in this lecture is the...
- Time Travel
Scott: Yeah, but let's assume we're talking about an...
- Who Can Name The Bigger Number
Who Can Name the Bigger Number?
- Talks
Scott Joel Aaronson (born May 21, 1981) [1] is an American theoretical computer scientist and Schlumberger Centennial Chair of Computer Science at the University of Texas at Austin. His primary areas of research are computational complexity theory and quantum computing.
Meanwhile, there’s already a second video on YouTube, entitled Philosopher reacts to ‘OpenAI expert Scott Aaronson on consciousness, quantum physics, and AI safety.’ So I opened the video, terrified that I was about to be torn a new asshole.
Aug 26, 2018 · Intro to Quantum Information Science. Someone recently wrote that my blog is “too high on nerd whining content and too low on actual compsci content to be worth checking too regularly.”. While that’s surely one of the mildest criticisms I’ve ever received, I hope that today’s post will help to even things out.
2009. Articles 1–20. David J. Bruton Centennial Professor of Computer Science, University of Texas at Austin - Cited by 17,338 - Quantum computing - computational complexity.
Mar 8, 2024 · In his compelling TEDx talk, Scott Aaronson confronts the prevalent notion of human exceptionalism in the era of artificial intelligence. As a distinguished figure in quantum computing and...
- 20 min
- 43.2K
- TEDx Talks
Scott Aaronson∗ Abstract In 1955, John Nash sent a remarkable letter to the National Security Agency, in which— seeking to build theoretical foundations for cryptography—he all but formulated what today we call the P =? NP problem, considered one of the great open problems of science. Here I