[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 2:58 PM

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 defined that has one natural
problem in it, take two drinks.

Whenever you are asked to vote on whether or not a problem is natural,
take three drinks.

Whenever a mistake is made that can be corrected during
that class, take one drink.

Whenever a mistake is made that can be corrected during
the next class, take two drinks.

Whenever a mistake is made that cannot be corrected because
it's just wrong, take three drinks.

Whenever a probability is amplified, refill your cups since
a class with zero or one natural problems in it is on its way.

Whenever the instructor says that a theorem has an application,
take a drink.

Whenever the instructor says that a theorem has an application,
and it actually does, take two drinks.

Whenever the instructor says that a theorem has an application
outside of theory, take two drinks.

Whenever the instructor says that a theorem has an application
outside of theory, and it really does, take four drinks.