Project Monkey-Math
It is often claimed that given enough time a monkey, even a small one like this, typing
at random, will almost certainly type out one of Shakespeare's plays (or any other
text you care to mention. In fact, every possible text). Sometimes the theory is
phrased in terms of an infinite number of monkeys typing. You will hear this referred
to as the Infinite Monkey Theorem.
Of course, this is a misnomer; if the time allowed is infinite, only a single (albeit
immortal) monkey is required. Furthermore, it could only be properly referred to as
an Infinite Monkey Theorem if the monkeys themselves were infinite. This is clearly
not the case, in fact this one is evidently quite small; he is not much bigger than his
Rubik's cube:
A small monkey, demonstrating one of the
permutations of an N x N x N Rubik's cube. In this case, the clever little monkey has
solved it! If you want to, you can find out how here (link coming soon).
The Infinite Monkey Theorem
This theorem was originally put forward as a way to illustrate the how immensely
unlikely it is that the laws of statistical mechanics will be violated in any measurable
way, but can also serve as a vehicle to illustrate just how ill-equipped the human
mind is to deal with infinities.
These points are valid, but miss the real point: this is the Infinite Monkey Theorem,
and Everyone likes monkeys.
In the Olden Days, Rubik's cubes were black and white, which made them much easier.
|