Randomness
From Maze
(Difference between revisions)
(→The Emergence of Randomness in Computing) | (→The Emergence of Randomness in Computing) | ||
| Line 32: | Line 32: | ||
<blockquote>The tables of random numbers in the book have become a standard reference in engineering and econometrics textbooks and have been widely used in gaming and simulations that employ Monte Carlo trials. Still the largest known source of random digits and normal deviates, the work is routinely used by statisticians, physicists, polltakers, market analysts, lottery administrators, and quality control engineers. (RAND Corporation)</blockquote> | <blockquote>The tables of random numbers in the book have become a standard reference in engineering and econometrics textbooks and have been widely used in gaming and simulations that employ Monte Carlo trials. Still the largest known source of random digits and normal deviates, the work is routinely used by statisticians, physicists, polltakers, market analysts, lottery administrators, and quality control engineers. (RAND Corporation)</blockquote> | ||
| − | These seemingly benign uses aside, the RAND report ominously explains that its one million random numbers were originally “prepared in connection with analyses done for the United States Air Force” (RAND Corporation). Like so many other advances in computing, randomness, it turns out, is intimately linked to Cold War military strategies. In fact, most of the early work on computer-based random number generation was performed under the auspices of the U.S. Atomic Energy Commission (see, for example, Rotenberg’s work in the late fifties) or the U.S military (such as Green et al’s work at MIT, with joint support of the U.S. Army, Navy, and Air Force). | + | Considering its sophisticated origins and uses, ''A Million Random Digits'' suggests a surprisingly unscientific method of using its tables: "In any use of the table, one should first find a random starting position. A common procedure for doing this is to open the book to an unselected page of the digit table and blindly choose a five-digit number" (RAND). Once again, it's randomness all the way down. This seemingly benign instruction aside, the RAND report ominously explains that its one million random numbers were originally “prepared in connection with analyses done for the United States Air Force” (RAND Corporation). Like so many other advances in computing, randomness, it turns out, is intimately linked to Cold War military strategies. In fact, most of the early work on computer-based random number generation was performed under the auspices of the U.S. Atomic Energy Commission (see, for example, Rotenberg’s work in the late fifties) or the U.S military (such as Green et al’s work at MIT, with joint support of the U.S. Army, Navy, and Air Force). |
As Donald Knuth relates in ''The Art of Computer Programming'', John von Neumann was the first to propose the idea of harnessing a computer to generate random numbers (Knuth 3). It was around 1946 and von Neumann was fresh off the Manhattan Project and soon to begin his lead work on the hydrogen bomb. Seeking a way to statistically determine the countless random factors that arise during each stage of the fission process, Von Neumann and his colleague Stanislaw Ulam originally relied the Monte Carlo method to generate tables of random numbers. These tables, however, soon grew too large to be stored on computers (Bennett 138-139). Von Neumann’s solution was to design a computer program to produce random numbers "on the fly," called the middle-square method. It worked by squaring an initial random number and extracting the middle digits; this number was then squared again, and the middle digits provided a new random number. The disadvantage of this method soon became apparent: because each number is a function of the one before it, the sequence, as Knuth explains, “isn’t random, but it appears to be” (Knuth 3)--a phenomenon known today as “pseudo-randomness,” which arguably describes any human or machine attempt to generate random numbers. | As Donald Knuth relates in ''The Art of Computer Programming'', John von Neumann was the first to propose the idea of harnessing a computer to generate random numbers (Knuth 3). It was around 1946 and von Neumann was fresh off the Manhattan Project and soon to begin his lead work on the hydrogen bomb. Seeking a way to statistically determine the countless random factors that arise during each stage of the fission process, Von Neumann and his colleague Stanislaw Ulam originally relied the Monte Carlo method to generate tables of random numbers. These tables, however, soon grew too large to be stored on computers (Bennett 138-139). Von Neumann’s solution was to design a computer program to produce random numbers "on the fly," called the middle-square method. It worked by squaring an initial random number and extracting the middle digits; this number was then squared again, and the middle digits provided a new random number. The disadvantage of this method soon became apparent: because each number is a function of the one before it, the sequence, as Knuth explains, “isn’t random, but it appears to be” (Knuth 3)--a phenomenon known today as “pseudo-randomness,” which arguably describes any human or machine attempt to generate random numbers. | ||
