Affiliation:
1. University of Illinois
Abstract
This paper remarks upon some issues involved in evaluating the "randomness" of numerical sequences. The question of how much to test is addressed, particularly with respect to pseudorandom generators. Historical failures of seemingly random sequences are noted. The dependence of evaluation programme upon proposed use of the sequence is stressed. The meaning and importance of stationarity are considered, and results from statistical distribution theory useful in checking for it, and in further evaluation of a sequence, are described. An example illustrates differences in power of three tests directed against a particular class of stationary alternatives to Normal white noise.
Publisher
Association for Computing Machinery (ACM)
Reference21 articles.
1. Statistical tests of random number generators;Bohrer R.;Simuletter,1977
2. Chaitin G. J. "Randomness and mathematical proof " Scientific American 47--52. Chaitin G. J. "Randomness and mathematical proof " Scientific American 47--52.
3. Fourier analysis of uniform random number generation;Coveyou R. R.;The Statistician,1967