Random Sequence Generation by Cellular Automata

@inproceedings{Wolfram2003RandomSG,
  title={Random Sequence Generation by Cellular Automata},
  author={Stephen Wolfram},
  year={2003}
}
A l-dimensional cellular automaton which generates random sequences is discussed. Each site in the cellular automaton has value 0 or 1, and is updated in parallel according to the rule n: = a,-, XOR (a, OR a,+r) (a; = (a,-, + a, + ~1, + , + (I, ai+ ,) mod 2). Despite the simplicity of this rule, the time sequences of site values that it yields seem to be completely random. These sequences are analysed by a variety of empirical, combinatorial, statistical, dynamical systems theory and… CONTINUE READING
Highly Influential
This paper has highly influenced 19 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 284 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

285 Citations

01020'01'04'08'12'16
Citations per Year
Semantic Scholar estimates that this publication has 285 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 37 references

CAM: A high-performance cellular-automaton machine, Physicu DlO (1984), 195: K

T. TOFFOLI
STEIGLITZ AND R. MORITA, A multi-processor cellular automaton chip, in “Proc. 1985 IEEE International Conf. on Acoustics, Speech, and Signal Processing,” March • 1985

Cellular automata and condensed matter physics, in Proc

S. WOLFRAM
NATO Advanced Study Institute on Scaling phenomena in disordered systems, April • 1985

Complexity of growing patterns in cellular automata, in “Dynamical systems and cellular automata,” (J

N. PACKARD
Demongeot, E. Goles, and M. Tchuente, Ids.), Academic Press, • 1985

Espresso software program,

R. RUDELL
Computer Science Dept., University of California, Berkeley, • 1985

The 3x + 1 problem and its generalizations

J. LAGARIAS
Amer. Math. Monthly • 1985

Similar Papers

Loading similar papers…