You are not currently logged in.
Access your personal account or get JSTOR access through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Jeffrey C. Lagarias
Vol. 8, No. 1, Report from the Committee on Applied and Theoretical Statistics of the National Research Council on Probability and Algorithms (Feb., 1993), pp. 31-39
Published by: Institute of Mathematical Statistics
Stable URL: http://www.jstor.org/stable/2246038
Page Count: 9
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
This article surveys the problem of generating pseudorandom numbers and lists many of the known constructions of pseudorandom bits. It outlines the subject of computational information theory. In this theory the fundamental object is a secure pseudorandom bit generator. Such generators are not theoretically proved to exist, although functions are known that appear to possess the required properties. In any case, pseudorandom number generators are known that work reasonably well in practice.
Statistical Science © 1993 Institute of Mathematical Statistics