Wikipedia
Smash Lord
The Infinite Monkey Theorem states that having an infinite amount of monkeys randomly typing on a typewriter for an infinite amount of time will eventually produce one of Shakespeare's plays or any other pre-chosen literature.
My source for this information is;
http://en.wikipedia.org/wiki/Infinitely_many_monkeys_(probability_theory)
The math for it is actually very simple.
Discuss this and any other theorems. Please, avoid the absurdly controversial ones, we wouldn't want this getting ugly. I think you know what I'm talking about.
My source for this information is;
http://en.wikipedia.org/wiki/Infinitely_many_monkeys_(probability_theory)
The math for it is actually very simple.
I don't know why but I thoroughly enjoy this theory, although not my favorite, it is still enjoyable to think about. My mind cannot simply comprehend a monkey typing out the complete text of Macbeth but the math is simple to support this event.Wikipedia.com said:Direct proof
The infinite monkey theorem is straightforward to prove. If two events are statistically independent, meaning neither affects the outcome of the other, then the probability of both happening equals the product of the probabilities of each one happening on its own. For example, if the chance of rain in Sydney on a particular day is 0.3 and the chance of an earthquake in San Francisco on that day is 0.008, the chance of both happening on that same day is 0.3 × 0.008 = 0.0024.
Suppose the typewriter has 50 keys, and the word to be typed is "banana". Typing at random, the chance that the first letter typed is b is 1/50, as is the chance that the second letter typed is a, and so on. These events are independent, so the chance of the first six letters matching banana is
(1/50) × (1/50) × (1/50) × (1/50) × (1/50) × (1/50) = (1/50)6.
For the same reason, the chance that the next 6 letters match banana is also (1/50)6, and so on.
From the above, the chance of not typing banana in a given block of 6 letters is 1 ? (1/50)6. Because each block is typed independently, the chance Xn of not typing banana in any of the first n blocks of 6 letters is
As n grows, Xn gets smaller. For an n of a million, Xn is 99.99%, but for an n of 10 billion Xn is 53% and for an n of 100 billion it is 0.17%. As n approaches infinity, the probability Xn approaches zero; that is, by making n large enough, Xn can be made as small as one likes.[1]
The same argument shows why infinitely many monkeys will (almost surely) produce a text as quickly as it would be produced by a perfectly accurate human typist copying it from the original. In this case Xn = (1 ? (1/50)6)n where Xn represents the probability that none of the first n monkeys types banana correctly on their first try. When we consider 100 billion monkeys, the probability falls to 0.17%, and as the number of monkeys n increases to infinity the value of Xn — the probability of the monkeys failing to reproduce the given text — decreases to zero. This is equivalent to stating that the probability that one or more of an infinite number of monkeys will produce a given text on the first try is 100%, or that it is almost certain they will do so.
Discuss this and any other theorems. Please, avoid the absurdly controversial ones, we wouldn't want this getting ugly. I think you know what I'm talking about.