Abstract
Computer simulations are everywhere, from the corporate office to the local video game parlor. With the increased role being played by these simulations, it is important for students to be completely aware of the limitations of pseudorandom number generators. The fact that random number generators in use today are not truly random is no secret (The New York Times, C1-C8). Since most simulations produce reasonable results it might be difficult to convince students that there are any problems involved in trusting these random number generators. A simple simulation which can be used as a programming exercise in any language can dramatically reveal these dangers.The exercise used requires a statistical evaluation of π which yields horrible results. The results are not difficult to explain and the exercise can be extended by allowing students to experiment with modifications to the pseudo-random number generator used in attempts to "fix" the problem. This can be useful, as the attempts to fix the pseudorandom number generator usually aggravate rather than alleviate the problem.
- "The Quest for True Randomness Finally Appears Successful." New York Times 19 April 1988, sec. C: 1-10.Google Scholar
- Lewis Research Center Programmer's Manual. Cleveland, Ohio. 1972.Google Scholar
- Abelson, Harold, et. al. Structure and Interpretation of Computer Programs. Cambridge : MIT Press, 1985. Google Scholar
Digital Library
- Knuth, Donald E. The Art of Computer Programming. Volume 2. Reading, Addison-Wesley, 1969. Google Scholar
Digital Library
- L'Ecuyer, Pierre. "Efficient and Portable Combined Random Number Generators." Communications of the ACM June 1988: 742-749. Google Scholar
Digital Library
Index Terms
Demonstrating the dangers of Pseudo-random numbers
Recommendations
ACORN-A new method for generating sequences of uniformly distributed Pseudo-random Numbers
A new family of pseudo-random number generators, the ACORN (additive congruential random number) generators, is proposed. The resulting numbers are distributed uniformly in the interval [0, 1). The ACORN generators are defined recursively, and the (k + ...
Generating good pseudo-random numbers
A widely used pseudo-random number generator has been shown to be inadequate by today's standards. In producing a revised generator, extensive use has been made of a test package TestU01 for random number generators. Using this, criteria have been ...
Bit-Wise Behavior of Random Number Generators
In 1985, G. Marsaglia proposed the m-tuple test, a runs test on bits, as a test of nonrandomness of a sequence of pseudorandom integers. We try this test on the outputs from a large set of pseudorandom number generators and discuss the behavior of the ...






Comments