The P-and-NP Show comes to Caltech

Here are the PowerPoint slides for a physics colloquium I gave at Caltech yesterday, on “Computational Intractability as a Law of Physics.” The talk was delivered, so I was told, in the very same auditorium where Feynman gave his Lectures on Physics. At the teatime beforehand, I was going to put both milk and lemon in my tea to honor the old man, but then I decided I actually didn’t want to.

I’m at Caltech till Tuesday, at which point I leave for New Zealand, to visit my friend Miriam from Berkeley and see a country I always wanted to see, and thence to Australia for QIP. This Caltech visit, my sixth or seventh, has been every bit as enjoyable as I’ve come to expect: it’s included using Andrew Childs as a straight man for jokes, shootin’ the qubits with Shengyu Zhang, Aram Harrow, and Robin Blume-Kohout, and arguing with Sean Carroll over which one of us is the second-funniest physics blogger (we both agree that Luboš is the funniest by far). Indeed, John Preskill (my host) and everyone else at the Institute for Quantum Information have been so darn hospitable that from now on, I might just have to shill for quantum computing theory.

21 Responses to “The P-and-NP Show comes to Caltech”

  1. John Sidles Says:

    Scott, wouldn’t P=NP resolve the “hard-AI” problem too?

    E.g: “Is there a plausible Turing Test whose answers can be checked by a deterministic algorithm that is demonstrably in complexity class NP, and if so, is there a program of length 10 TBytes or less that yields answers that pass this test?”

    Rather than express an opinion for myself, here is the (very enjoyable) Turing Test Page, which has many references.

  2. Scott Says:

    John: There’s a very real question how much of the problem of simulating human intelligence is in NP to begin with! I.e. can you give a polytime algorithm to recognize a great symphony when you hear one?

    That said, certainly if P=NP there would be dramatic consequences for AI. For example, you could efficiently find the shortest program that outputs (say) the complete works of Shakespeare or stock market data in a reasonable amount of time. The question is just how much that would do for you — i.e. once you had that short description, could you use it to predict the future or write plays that Shakespeare himself never wrote?

  3. Kea Says:

    Cool! Are you going to be in NZ after Jan 29? If so, you are hereby cordially invited to give a talk in the Dept of Physics at the University of Canterbury. I’ll arrange it – or you could just email the seminar organiser. Anyway, where are you going in NZ? You can’t miss the South Island.

  4. Kea Says:

    Bonus: if you like hiking, just let me know.

  5. John Sidles Says:

    Hmmmm … output Shakespeare? Too easy.

    Let’s see … how about, “the shortest program that outputs valid proofs of every theorem in Serge Lang’s Algebra (Third Edition)”.

    Heck, we might as well make it “That can prove every theorem and solve every problem in <every math and physics book ever published>”.

    Then the tough question is: would it be possible to learn anything important about math and physics by inspecting this code?

    More loosely, would this program necessarily be able to explain what it was doing? Would it make a good thesis advisor? 🙂

  6. Dave Bacon Says:

    Bridge lecture hall was where I took freshman physics…or at least where I was supposed to go to take freshman physics…I didn’t really like going to class much.

    BTW, ask Daniel Gottesman about that room, Feynman, and the talk he gave there.

  7. Scott Says:

    Cool! Are you going to be in NZ after Jan 29? If so, you are hereby cordially invited to give a talk in the Dept of Physics at the University of Canterbury.

    Sorry, Kea! I’m leaving on Jan. 29 for Brisbane, since QIP starts the morning of the 30th. And to make matters worse, I’ll be in Auckland, which (looking at a map) seems to be quite a ways from Christchurch. 🙂 (You never realize how big a country is until you’re actually planning a trip there.) But thanks so much anyway for the invitation!

  8. Scott Says:

    John (and everyone else): Please remember to close your italics tags — WordPress being stupid, it seems that otherwise you involuntarily italicize all the other comments! In this case, the way I fixed the problem was by putting a closing </i> tag at the beginning of my own comment. 🙂

  9. John Sidles Says:

    Apologies for the html markup bug. Good thing it wasn’t an unclosed “<strike>” … doh !!!

    (no, I didn’t really do it) 🙂

  10. Ari Says:

    Argh, sorry I missed it … I’m an applied math guy at Caltech, but I enjoy the blog and would have liked to attend the talk. Any other events/lectures planned before you depart Pasadena?

  11. Scott Says:

    Sorry, Ari! I guess I should announce talks in advance.

    If you’d like, come by 156B Jorgensen around 1PM on Monday and join our group for lunch.

  12. Ari Says:

    Thanks for the invite, Scott, but unfortunately I don’t think I can make it. (Too much work, presenting a poster on Tuesday … such is the life of a grad student.) Perhaps I’ll catch the P-vs-NP show the next time it hits the west coast. Thanks again!

  13. Scott Coon Says:

    This probably falls in the category of “there really are stupid questions”, but is there any connection between Bennett et al. ’97’s n/2 result and the fact that the complex numbers are a quadratic extension of the reals (i.e., complex phases vs. real probabilities)?

  14. Scott Says:

    is there any connection between Bennett et al. ’97’s n/2 result and the fact that the complex numbers are a quadratic extension of the reals (i.e., complex phases vs. real probabilities)?

    First of all, it’s sqrt(n), not n/2.

    The fact that quantum search takes sqrt(n) time is directly related to quantum mechanics being based on the 2-norm instead of the 1-norm. It’s not related to real vs. complex numbers, since you’d get exactly the same result (sqrt(n)) with real amplitudes only.

  15. Pascal Koiran Says:

    Does the characterization of PP as PostBQP help to solve any of the open problems on the closure properties of PP ?
    (I suspect it doesn’t, or you would have already done it,
    right ?)

  16. Scitt Says:

    Open problems — like what?

  17. The Quantum Pontiff » Says:

    […] Hey, since Scott Aaronson can now claim to be “the second funniest physics blogger,” maybe with these skills I can claim to be “the second least funny computer science blogger!” […]

  18. Pascal Koiran Says:

    > Open problems — like what?

    According to the Complexity Theory Companion, there were a few generalizations of the “closure under intersection” result. For instance, in 1996 Fortnow (who would become famous later for his Computational Complexity blog) and Reingold proved closure under truth-table reductions.
    But the book claims that closure under polynomial time Turing reductions is open.

  19. Scott Says:

    Oh, that! You can certainly use the PostBQP characterization to reprove Reingold’s result on closure under truth-table reductions — I say that in the paper.

    As for closure under Turing reductions, if that held it would mean P = PP^PP! And that would be extremely surprising — Beigel gave an oracle relative to which not even P^NP is contained in PP. So most likely, the reason my characterization doesn’t give you closure under Turing reductions is that it’s false! 🙂

  20. Pascal Koiran Says:

    Thanks for the quick answer – you meant PP = P^PP, right ?
    Speaking of relativizations, does the closure under intersection result relativize ?

  21. Scott Says:

    Yeah, I meant PP = P^PP — sorry. Miriam, my hostess here in Auckland, is not leaving me a lot of time to double-check my blog comments. 🙂

    Yes, the closure under intersection result relativizes.