Loading ...
Sorry, an error occurred while loading the content.

[Computational Complexity] Complexity Theory Class Drinking Game

Expand Messages
  • GASARCH
    Complexity Theory Class Drinking Game - Whenever a complexity class is defined that has zero natural problems in it, take one drink. - Whenever a class is
    Message 1 of 1 , Dec 14, 2007
    • 0 Attachment
      Complexity Theory Class Drinking Game
      1. Whenever a complexity class is defined that has zero natural problems in it, take one drink.
      2. Whenever a class is defined that has one natural problem in it, take two drinks.
      3. Whenever you are asked to vote on whether or not a problem is natural, take three drinks.
      4. Whenever a mistake is made that can be corrected during that class, take one drink.
      5. Whenever a mistake is made that can be corrected during the next class, take two drinks.
      6. Whenever a mistake is made that cannot be corrected because it's just wrong, take three drinks.
      7. Whenever a probability is amplified, refill your cups since a class with zero or one natural problems in it is on its way.
      8. Whenever the instructor says that a theorem has an application, take a drink.
      9. Whenever the instructor says that a theorem has an application, and it actually does, take two drinks.
      10. Whenever the instructor says that a theorem has an application outside of theory, take two drinks.
      11. Whenever the instructor says that a theorem has an application outside of theory, and it really does, take four drinks.


      --
      Posted By GASARCH to Computational Complexity at 12/14/2007 04:58:00 PM
    Your message has been successfully submitted and would be delivered to recipients shortly.