Random number generators are chaotic

Authors:
C. Herring;J. I. Palmore
Affiliations:
Engineering Research Laboratory, P.O. Box 4005, Champaign, IL;University of Illinois, Department of Mathematics, 1409 W. Green Street, Urbana, IL
Venue:
ACM SIGPLAN Notices
Year:
1989

Citing 3
Cited 0

Chaos: making a new science

Chaos: making a new science
Random number generators: good ones are hard to find

Communications of the ACM
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We observe that pseudo-random number generators, familiar to all programmers, are examples of deterministic chaotic dynamical systems. We discuss the implications of this finding and compare computer generation of pseudo-random numbers to the theoretical ideal of a (noncomputable) random sequence.