You can’t prove you won’t want to be there

Avi Wigderson has asked me to announce that Princeton’s recently-founded and delightfully-named Center for Computational Intractability will be holding a week-long workshop on Barriers in Computational Complexity, this August 25th to 29th.  Apparently I’m even co-organizing one of the sessions.  So register now!  Lowerbounderati, provers of meta-impossibility theorems, and other congenital pessimists are particularly discouraged from not attending.

8 Responses to “You can’t prove you won’t want to be there”

  1. Luca Says:

    The website recommends to ask the hotel for the “barriers worship” discount

  2. Jonathan Vos Post Says:

    Will there be noncomputable registration fees?

  3. Yevgeniy Says:

    How do we register?

  4. Scott Says:

    From the website: To request to register to the workshop send an email to barriers.workshop {at} gmail(.)com

  5. harrison Says:

    Luca: I expect the “barrier worship” discount is for either extreme proponents of the sanctity of the Western Wall, or for scary intractability groupies :).

  6. David Says:

    Your double negatives, they killz me.

  7. joey joe joey Says:

    “…process,” according to Schoelkopf. “It’s like being able to place one phone call that simultaneously tests all four numbers, but only goes through to the right one.”
    First Solid-State Quantum Computer Processor Created – Popular Science [06/29/2009]”

  8. joey joe joey Says:

    “The peculiar advantage of quantum bits is that thanks to the strange laws of quantum physics, they can be in two states at once–both one and zero simultaneously. That means a quantum processor can analyze multiple data sets in parallel, a feature that would theoretically allow quantum computers to tear through some types of data processing tasks at exponentially higher rates.”