Abstract
Random numbers are needed in a variety of applications, yet finding good random number generators is a difficult task. In this paper non-uniform cellular automata (CA) are studied, presenting the cellular programming algorithm for co-evolving such CAs to perform computations. The algorithm is applied to the evolution of random number generators; our results suggest that evolved generators are at least as good as previously described CAs, with notable advantages arising from the existence of a "tunable" algorithm for obtaining random number generators.
| Original language | English |
|---|---|
| Pages (from-to) | 181-190 |
| Number of pages | 10 |
| Journal | International Journal of Modern Physics C |
| Volume | 7 |
| Issue number | 2 |
| DOIs | |
| State | Published - 1 Jan 1996 |
| Externally published | Yes |
ASJC Scopus subject areas
- Statistical and Nonlinear Physics
- Mathematical Physics
- General Physics and Astronomy
- Computer Science Applications
- Computational Theory and Mathematics