Axiom of fun choice

Posted in Fun links, Math by Mike Stay on 2011 April 14

A fun choice function is a function f defined on a collection J of jobs that must be done such that for every job j \in J, f(j) is an element of fun. The axiom of fun choice states,

For any set \displaystyle J of jobs that must be done, there exists a fun choice function defined on \displaystyle J.

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.


4 Responses

Subscribe to comments with RSS.

  1. Doug said, on 2011 April 14 at 5:25 pm

    Her thesis further states that such jobs become cake. There is reason to believe that the cake is isomorphic to a Lie group.

    • reperiendi said, on 2011 September 22 at 4:08 pm

      I played Portal for the first time last week (since it was being given away for free) and now I finally get your joke.

  2. Rebecca Stay said, on 2011 April 18 at 7:52 pm

    Funny. Both of you.

  3. […] 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 […]

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

%d bloggers like this: