Editing Infinite monkey theorem (section)

===Random document generation===
The theorem concerns a [[thought experiment]] which cannot be fully carried out in practice, since it is predicted to require prohibitive amounts of time and resources. Nonetheless, it has inspired efforts in finite random text generation.

One computer program run by Dan Oliver of Scottsdale, Arizona, according to an article in ''[[The New Yorker]]'', came up with a result on 4&nbsp;August 2004: After the group had worked for 42,162,500,000&nbsp;billion billion monkey-years, one of the "monkeys" typed, "<samp>VALENTINE. Cease toIdor:eFLP0FRjWK78aXzVOwm)-‘;8.t</samp>" The first 19&nbsp;letters of this sequence can be found in "The Two Gentlemen of Verona". Other teams have reproduced 18&nbsp;characters from "Timon of Athens", 17 from "Troilus and Cressida", and 16 from "Richard II".<ref name="ja">{{cite magazine |url=http://www.newyorker.com/arts/critics/books/2007/04/09/070409crbo_books_acocella?currentPage=all |last=Acocella |first=Joan |title=The typing life: How writers used to write |magazine=[[The New Yorker]] |date=9 April 2007}} – a review of {{cite book |title=The Iron Whim: A fragmented history of typewriting |publisher=Cornell University Press |year=2007 |first=Darren |last=Wershler-Henry}}</ref>

A website entitled ''The Monkey Shakespeare Simulator'', launched on 1&nbsp;July 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. For example, it produced this partial line from ''[[Henry IV, Part 2]]'', reporting that it took "2,737,850&nbsp;million billion billion billion monkey-years" to reach 24 matching characters:
:<samp>RUMOUR. Open your ears; 9r"5j5&?OWTY Z0d</samp>

Due to processing power limitations, the program used a probabilistic model (by using a [[random number generator]] or RNG) instead of actually generating random text and comparing it to Shakespeare. When the simulator "detected a match" (that is, the RNG generated a certain value or a value within a certain range), the simulator simulated the match by generating matched text.<ref>{{cite web |url=http://io9.gizmodo.com/5809583/the-story-of-the-monkey-shakespeare-simulator-project |title=The story of the Monkey Shakespeare Simulator Project |last1=Inglis-Arkell |first1=Esther |date=June 9, 2011 |website=io9 |publisher=gizmodo |access-date=24 February 2016}}</ref>