Corpus ID: 2970397

Universality in Elementary Cellular Automata

@article{Cook2004UniversalityIE,
  title={Universality in Elementary Cellular Automata},
  author={M. Cook},
  journal={Complex Syst.},
  year={2004},
  volume={15}
}
  • M. Cook
  • Published 2004
  • Mathematics, Computer Science
  • Complex Syst.
  • 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
    565 Citations
    A Physically Universal Cellular Automaton
    • 11
    Proving a phase transition in cellular automata under asynchronous dynamics
    New aspects of symmetry of elementary cellular automata
    • 6
    • PDF
    Communication complexity and intrinsic universality in cellular automata
    • 25
    • PDF
    Pattern Generation by Cellular Automata (Invited Talk)
    • J. Kari
    • Mathematics, Computer Science
    • RTA
    • 2013
    Universalities in Cellular Automata
    • 14
    Directed Percolation Arising in Stochastic Cellular Automata Analysis
    • 12
    • PDF
    Classsification of Cellular Automata
    • 1

    References

    SHOWING 1-10 OF 18 REFERENCES
    Universality and complexity in cellular automata
    • 1,886
    • PDF
    Theory and Applications of Cellular Automata
    • 1,581
    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
    Elementary formal systems
    • 5
    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