Blowing out the stack is the least of your problems. Cease toIdor:eFLP0FRjWK78aXzVOwm)-;8.t" The first 19letters of this sequence can be found in "The Two Gentlemen of Verona". The probability that an infinite randomly generated string of text will contain a particular finite substring is1. A quotation attributed[22] to a 1996 speech by Robert Wilensky stated, "We've heard that a million monkeys at a million keyboards could produce the complete works of Shakespeare; now, thanks to the Internet, we know that is not true. Infinite monkey theorem explained. Nevertheless, Anderson's methods could potentially be applied to real-world problems, such as DNA sequencing. Since probabilities are numbers between 0 and 1, by multiplying them, we make these numbers smaller. I give school talks about maths and puzzles (online and in person). A website entitled The Monkey Shakespeare Simulator, launched on 1July 2003, contained a Java applet that simulated a large population of monkeys typing randomly, with the stated intention of seeing how long it takes the virtual monkeys to produce a complete Shakespearean play from beginning to end. The probability that an infinite randomly generated string of text will contain a particular finite substring is1. the infinite monkey theorem goes as follows: a monkey hitting random keys on a typewriter, given an infinite amount of time, will at some point type out the . Infinite monkey theorem in popular culture - Wikipedia Any reader who has nothing to do can amuse himself by calculating how long it would take for the probability to be worth betting on. Did you solve it? The infinite monkey theorem For the second theorem, let Ek be the event that the kth string begins with the given text. Lets just assume (for the sake of simplicity) that the monkey only has a choice of 40 keys which include the alphabet (a, b, c, z), some punctuation (,, ., :,) and space.