Explore >> Select a destination
|
You are here 
|
mycqstate.wordpress.com | ||
| | | | |
scottaaronson.blog
|
|
| | | | | Two years ago, I posted detailed lecture notes on this blog for my Intro to Quantum Information Science undergrad course at UT Austin. Today, with enormous thanks to UT PhD student Corey Ostrove, we've gotten the notes into a much better shape (for starters, they're now in LaTeX). You can see the results here (7MB)---it's... | |
| | | | |
blog.computationalcomplexity.org
|
|
| | | | | March Edition For our next favorite theorem, we look at the surprising power of provers who share entangled bits. If you can prove something... | |
| | | | |
gilkalai.wordpress.com
|
|
| | | | | Yael Tauman Kalai: Delegating Computation via No-Signaling Strategies. Ladies and Gentelmen, Here is, exclusively for our readers, Yael Tauman Kalai's ICM2018 paper: Delegating Computation via No-Signaling Strategies. The opportunity to present the paper arose when a week ago I attended a great lecture on game theory by Yair Tauman and met there Adam Kalai, Yael, | |
| | | | |
scottaaronson.blog
|
|
| | | In Michael Sipser's Introduction to the Theory of Computation textbook, he has one Platonically perfect homework exercise, so perfect that I can reconstruct it from memory despite not having opened the book for over a decade. It goes like this: Let f:{0,1}*?{0,1} be the constant 1 function if God exists, or the constant 0 function... | ||
