# Universality in Elementary Cellular Automata

@article{Cook2004UniversalityIE, title={Universality in Elementary Cellular Automata}, author={M. Cook}, journal={Complex Syst.}, year={2004}, volume={15} }

The purpose of this paper is to prove that one of the simplest one dimensional cellular automata is computationally universal, implying that many questions concerning its behavior, such as whether a particular sequence of bits will occur, or whether the behavior will become periodic, are formally undecidable. The cellular automaton we will prove this for is known as “Rule 110” according to Wolfram’s numbering scheme [2]. Being a one dimensional cellular automaton, it consists of an infinitely… CONTINUE READING

#### Figures and Topics from this paper.

565 Citations

Advances in the study of elementary cellular automata regular language complexity

- Mathematics, Computer Science
- Complex.
- 2016

4

Communication complexity and intrinsic universality in cellular automata

- Mathematics, Computer Science
- Theor. Comput. Sci.
- 2011

25- PDF

Directed Percolation Arising in Stochastic Cellular Automata Analysis

- Mathematics, Computer Science
- MFCS
- 2008

12- PDF

#### References

SHOWING 1-10 OF 18 REFERENCES

Stephen Wolfram originally introduced his numbering scheme in Statistical Mechanics of Cellular Automata

- Reviews of Modern Physics
- 1983

A New Kind of Science (Wolfram Media

- A New Kind of Science (Wolfram Media
- 2002

Chapters 6 of Marvin Minsky's book Computation: Finite and Infinite Machines (Prentice-Hall, 1972) provides a very readable and motivated (by chapter 5) introduction to Turing machines

- Chapters 6 of Marvin Minsky's book Computation: Finite and Infinite Machines (Prentice-Hall, 1972) provides a very readable and motivated (by chapter 5) introduction to Turing machines

Emil Post studied tag systems as a graduate student in 1921, and found that it was very hard to prove anything at all about them

- Emil Post studied tag systems as a graduate student in 1921, and found that it was very hard to prove anything at all about them

John Conway wrote an exposition of "The Game of Life" (a now famous two dimensional cellular automaton that he discovered)

Nordahl exhibited a universal one dimensional cellular automaton with (k ( 7, r ( 1) and (k ( 4, r ( 2), in Universal Computation in Simple One-Dimensional

- Cellular Automata, in Complex Systems,
- 1990

Nordahl exhibited a universal one dimensional cellular automaton with (k 7, r 1) and (k 4, r 2), in Universal Computation in Simple One-Dimensional Cellular Automata

- Complex Systems
- 1990