We think you have liked this presentation. If you wish to download it, please recommend it to your friends in any social system. Share buttons are a little bit lower. Thank you!
Presentation is loading. Please wait.
Published byIsaac Johnston
Modified over 3 years ago
Scott Aaronson Associate Professor, EECS And Why Every Other Major Sucks By Comparison
Stereotypes of CS Majors
So whats next?
Uploading our brains to computers; replacement of real life by the Matrix
= So what else is there?
What weve learned from quantum computers so far: 15 = 3 × 5 (with high probability)
Relativity Computer DONE
Zenos Computer STEP 1 STEP 2 STEP 3 STEP 4 STEP 5 Time (seconds)
Time Travel Computer S. Aaronson and J. Watrous. Closed Timelike Curves Make Quantum and Classical Computing Equivalent, Proceedings of the Royal Society A 465:631-647, 2009. arXiv:0808.2669.
Computer Science Is Interdisciplinary Math Biology Economics Physics Brain/Cognitive
Conclusions -Great choice to get admitted here -Come to MIT -You could do a course other than 6-3, but why?
Scott Aaronson Associate Professor, EECS Quantum Computers and Beyond.
Scott Aaronson (MIT) The Limits of Computation: Quantum Computers and Beyond.
THE QUANTUM COMPLEXITY OF TIME TRAVEL Scott Aaronson (MIT)
Closed Timelike Curves Make Quantum and Classical Computing Equivalent
Quantum Computing and the Limits of the Efficiently Computable Scott Aaronson MIT.
Scott Aaronson (MIT) Based on joint work with John Watrous (U. Waterloo) BQP PSPACE Quantum Computing With Closed Timelike Curves.
Quantum Computing and the Limits of the Efficiently Computable Scott Aaronson (MIT)
Quantum Computing and the Limits of the Efficiently Computable Scott Aaronson (MIT UT Austin) NYSC, West Virginia, June 24, 2016.
When Qubits Go Analog A Relatively Easy Problem in Quantum Information Theory Scott Aaronson (MIT)
Great Theoretical Ideas in Computer Science.
The Institute for Quantum Computing University of Waterloo Professor Raymond Laflamme Director.
In S.T.E.M we do Science, Technology, Engineering, Maths. So far we have only done Maths… We have also played many games in our sessions. Here are a few:-
One time-travelling bit is as good as logarithmically many
Review of important distributions Another randomized algorithm
BQP PSPACE NP P PostBQP Limits on Efficient Computation in the Physical World Scott Aaronson MIT.
ROC Curve and Classification Matrix for Binary Choice Professor Thomas B. Fomby Department of Economics SMU Dallas, TX February, 2015.
What is Psychology? Pages What is Psychology? Give me your own personal definition of Psychology.
B.F. SKINNER AND BEHAVIORISM Ronald F. White, Ph.D. Professor of Philosophy College of Mount St. Joseph.
Student Stories Interdisciplinary Science course. After meeting the staff and getting to know a bit more about the structure of the course I decided on.
Reference: "Artificial Intelligence, a Modern Approach, 3rd ed."
© 2017 SlidePlayer.com Inc. All rights reserved.