Editing Infinite monkey theorem (section)

===Testing of random-number generators===
{{main|Diehard tests}}
Questions about the statistics describing how often an ideal monkey is [[expected value|expected]] to type certain strings translate into [[Randomness tests|practical tests for random-number generators]]; these range from the simple to the "quite sophisticated". Computer-science professors [[George Marsaglia]] and [[Arif Zaman]] report that they used to call one such category of tests "overlapping m-[[tuple]] tests" in lectures, since they concern overlapping m-tuples of successive elements in a random sequence. But they found that calling them "monkey tests" helped to motivate the idea with students. They published a report on the class of tests and their results for various RNGs in 1993.<ref name="Marsaglia1993">
{{Cite journal |last1=Marsaglia |first1=George |last2=Zaman |first2=Arif |year=1993 |title=Monkey tests for random number generators |journal=Computers & Mathematics with Applications |publisher=Elsevier, Oxford |volume=26 |issue=9 |pages=1–10 |doi=10.1016/0898-1221(93)90001-C |issn=0898-1221 |doi-access=free}}
</ref>