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.
No takes yet. Share an insight, caveat, or question.
Herring et al. (1989) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: