Advertisement

The Visual Computer

, Volume 11, Issue 7, pp 369–377 | Cite as

Random number generators: Pretty good ones are easy to find

  • Clifford A. Pickover
Original Articles

Abstract

A popular conception is that random number generators are very difficult to build. I informally discuss some easily programmed, easily remembered, random number generators. Simple graphical techniques are introduced for assessing the quality of the generators with little training. To encourage reader involvement, computational recipes are included.

Keywords

Image Processing Artificial Intelligence Random Number Computer Graphic Number Generator 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Clark RN (1985) A pseudorandom number generator. Simulation 45:252–255Google Scholar
  2. 2.
    Collins J, Fancilulli M, Hohlfeld R, Finch D, Sandri G, Shtatland E (1992) A random number generator based on the logit transform of the logistic variable. Comput Phys 6:630–632Google Scholar
  3. 3.
    Colonna J (1994) The subjectivity of computers. Commun ACM. 36:15–18Google Scholar
  4. 4.
    Ferrenberge A, Landau D, Wong Y (1992) Monte Carlo simulations: hidden errors from “good” random number generators. Phys Rev Lett 69:3382–3384Google Scholar
  5. 5.
    Gordon G (1978) System simulation. Prentice-Hall. Engelwood Cliffs, N.JGoogle Scholar
  6. 6.
    Grossman S, Thomae S (1977) Invariant, distributions and stationary correlation functions. Z Naturforsh 32a:1353Google Scholar
  7. 7.
    Hennecke M (1994) RANEXP: experimental random number generator package. Comput Phys Commun 79:261Google Scholar
  8. 8.
    James F (1990) A review of pseudorandom number generators. Comput Phys Commun 60:329–344Google Scholar
  9. 9.
    James (1994) RANLUX: A Fortran implementation of the high-quality pseudorandom number generator of Luscher. Comput Phys Commun 79:111–114Google Scholar
  10. 10.
    Jefferey H (1994) Fractals and genetics in the future. In: Pickover C (ed) Visions of the future: art, technology, and computing in the 21st century. St. Martin's Press, New YorkGoogle Scholar
  11. 11.
    Knuth D (1981) The art of computer programming, Vol. 2, 2nd edn. Addison-Wesley, Reading MassGoogle Scholar
  12. 12.
    Luscher M (1994) A portable high-quality random number generator for lattice field theory simulations. Comput Phys Commun 79:100–110Google Scholar
  13. 13.
    Marsagilia G, Zaman A (1991) A new class of random number generators. Ann Appl Probability 1:462–480Google Scholar
  14. 14.
    Marsagilia G, Zaman A (1994) Some portable very-long-period random number generators. Comput Phys 8:117–121Google Scholar
  15. 15.
    Mckean K (1987) The orderly pursuit of disorder. Discover 5:72–81Google Scholar
  16. 16.
    Park S, Miller K (1988) Random numbers generators: good ones are hard to find. Commun ACM 31:1192–1201Google Scholar
  17. 17.
    Pickover C (1990) Computers, pattern, chaos and beauty. St. Martin's Press, N.YGoogle Scholar
  18. 18.
    Pickover C (1991a) Picturing randomness on a graphics supercomputer. IBM J Res Devel 35:227–230Google Scholar
  19. 19.
    Pickover C (1991b) Computers and the imagination. St. Martin's Press, N.YGoogle Scholar
  20. 20.
    Pickover C (1992) Mazes for the mind: computers and the unexpected. St. Martin's Press, New YorkGoogle Scholar
  21. 21.
    Pickover C (1994) Chaos in wonderland: visual adventures in a fractal world. St. Martin's Press, New YorkGoogle Scholar
  22. 22.
    Pickover C (1995a) Terrain generation via the logit transformation of the logistic variable, IEEE Comput Graph 15:18–21Google Scholar
  23. 23.
    Pickover C (1995b) Keys to Infinity. Wiley, New YorkGoogle Scholar
  24. 24.
    Pickover C, Tewksbury S (1994) Frontiers of scientific visualization. Wiley, New YorkGoogle Scholar
  25. 25.
    Richards T (1989) Graphical representation of pseudorandom sequences. Comput Graph 13:261–262Google Scholar
  26. 26.
    Schroeder M (1991) Fractals, chaos, power laws. Freeman, N.YGoogle Scholar
  27. 27.
    Stein P, Ulam S (1964) Rozpr 39:1Google Scholar
  28. 28.
    Ulam S, von Neumann J (1947) Bull Am Math Soc 53:1120Google Scholar
  29. 29.
    Voelcker J (1988) Picturing randomness. IEEE Spectrum. 25:13Google Scholar

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • Clifford A. Pickover
    • 1
  1. 1.IBM Watson Research CenterYorktown HeightsUSA

Personalised recommendations