skip to main content
article
Free Access

Demonstrating the dangers of Pseudo-random numbers

Published:01 June 1989Publication History
Skip Abstract Section

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.

References

  1. "The Quest for True Randomness Finally Appears Successful." New York Times 19 April 1988, sec. C: 1-10.Google ScholarGoogle Scholar
  2. Lewis Research Center Programmer's Manual. Cleveland, Ohio. 1972.Google ScholarGoogle Scholar
  3. Abelson, Harold, et. al. Structure and Interpretation of Computer Programs. Cambridge : MIT Press, 1985. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Knuth, Donald E. The Art of Computer Programming. Volume 2. Reading, Addison-Wesley, 1969. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. L'Ecuyer, Pierre. "Efficient and Portable Combined Random Number Generators." Communications of the ACM June 1988: 742-749. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Demonstrating the dangers of Pseudo-random numbers

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image ACM SIGCSE Bulletin
        ACM SIGCSE Bulletin  Volume 21, Issue 2
        June 1989
        66 pages
        ISSN:0097-8418
        DOI:10.1145/65738
        Issue’s Table of Contents

        Copyright © 1989 Author

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 1 June 1989

        Check for updates

        Qualifiers

        • article

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!