Axiom of fun choice
A fun choice function is a function defined on a collection of jobs that must be done such that for every job is an element of fun. The axiom of fun choice states,
For any set of jobs that must be done, there exists a fun choice function defined on
This axiom asserts that one can always find the fun in any job that must be done; a theorem of Poppins deduces from this that all such jobs are games.
Her thesis further states that such jobs become cake. There is reason to believe that the cake is isomorphic to a Lie group.
I played Portal for the first time last week (since it was being given away for free) and now I finally get your joke.
Funny. Both of you.
[…] thought nothing when Thursday started on a lighter note with reperiendi settling, once and for all, the old argument whether to believe in some form of the axiom… and Computational Complexity going off topic in class. But then John Baez hit you with a reminder […]