[1] : Jargon File (4.3.1, 29 Jun 2001)

infinite-monkey theorem n. "if you put an infinite number of monkeys
   at typewriters, eventually one will bash out the script for hamlet."
   one may also hypothesize a small number of monkeys and a very long
   period of time. this theorem asserts nothing about the intelligence of
   the one random monkey that eventually comes up with the script and
   note that the mob will also type out all the possible _incorrect_
   versions of hamlet. it may be referred to semi-seriously when
   justifying a brute force method; the implication is that, with enough
   resources thrown at it, any technical challenge becomes a one-banana
   problem. this argument gets more respect since linux justified the
   bazaar mode of development.

   this theorem was first popularized by the astronomer sir arthur
   eddington. it became part of the idiom of techies via the classic sf
   short story "inflexible logic" by russell maloney, and many younger
   hackers know it through a reference in douglas adams's "hitchhiker's
   guide to the galaxy". on 1 april 2000 the usage acquired its own
   internet standard, rfc2795 http://www.ietf.org/rfc/rfc2795.txt
   infinite monkey protocol suite.


see also:
infinite random brute force one-banana problem linux bazaar 

Theorem >> T Words
Theorem, definition of term: Theorem
theorem_pag1.html