# Universality in Elementary Cellular Automata

@article{Cook2004UniversalityIE, title={Universality in Elementary Cellular Automata}, author={Matthew 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… Expand

#### Figures and Topics from this paper

#### 604 Citations

Advances in the study of elementary cellular automata regular language complexity

- Mathematics, Computer Science
- Complex.
- 2016

This work studies the time evolution of elementary CA, in terms of such a regular language complexity, and describes an alternative method for generating the subsequent finite automata in time, and provides a method to analyze and detect patterns in the complexity growth of the rules. Expand

Cellular Automata, Universality of

- Computer Science
- Encyclopedia of Complexity and Systems Science
- 2009

Glossary Cellular automata They are dynamical systems that are continuous, local, parallel, synchronous and space and time uniform. Cellular automata are used to model phenomena where the space can… Expand

A Physically Universal Cellular Automaton

- Computer Science, Mathematics
- ITCS
- 2015

The first known example of a physically universal CA is given, answering an open problem of Janzing and opening the way for further research in this area. Expand

Proving a phase transition in cellular automata under asynchronous dynamics

- Computer Science
- 2012

The existence of a polynomial/exponential phase transition in a cellular automaton called FLIP-IF-NOT-ALL-0 is proved in order to understand the behaviors which appear at low synchronicity. Expand

Computational Hierarchy of Elementary Cellular Automata

- Computer Science, Physics
- ArXiv
- 2021

This paper studies the ability of automata to emulate one another through their computational capacity, and uses the emulation notion to suggest a novel definition of chaos that is suitable for discrete computational systems. Expand

New aspects of symmetry of elementary cellular automata

- Mathematics, Physics
- 2013

We present a new classification of elementary cellular automata. It is based on the structure of the network of states, connected with the transitions between them; the latter are determined by the… Expand

Pattern Generation by Cellular Automata (Invited Talk)

- Mathematics, Computer Science
- RTA
- 2013

This work considers the automata that multiply by constants 3 and 3/2 in base 6 and discusses the connections of these automata to some difficult open questions in number theory, and poses several further questions concerning pattern generation in cellular automata. Expand

Communication complexity and intrinsic universality in cellular automata

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

This article introduces necessary conditions for a cellular automaton to be ''universal'', according to a precise notion of simulation, related both to the dynamics of cellular automata and to their computational power. Expand

Universalities in Cellular Automata

- Mathematics, Computer Science
- Handbook of Natural Computing
- 2012

This chapter is dedicated to computational universalities in cellular automata, essentially Turing universality, the ability to compute any recursive function, and intrinsic universality, the ability… Expand

Classsification of Cellular Automata

- 2007

Glossary Cellular Automaton For our purposes, a (one-dimensional) cellular automaton (CA) is given by a local map ρ : Σ → Σ where Σ is the underlying alphabet of the automaton and w is its width. As… Expand

#### References

SHOWING 1-10 OF 18 REFERENCES

Universality and complexity in cellular automata

- Computer Science, Mathematics
- 1983

Evidence is presented that all one-dimensional cellular automata fall into four distinct universality classes, and one class is probably capable of universal computation, so that properties of its infinite time behaviour are undecidable. Expand

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

Thanks to David Eppstein for figuring out that the two-symbol machine can be achieved with only seven states

- Thanks to David Eppstein for figuring out that the two-symbol machine can be achieved with only seven states
- 1998

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

Stephen Wolfram notes that some simple cellular automata are " class 4 " , but does not yet notice any as simple as

- Undecidability and Intractibility in Theoretical Physics
- 1985

Stephen Wolfram notes that some simple cellular automata are "class 4", but does not yet notice any as simple as (k 2, r 1), in Undecidability and Intractibility in Theoretical Physics

- Physical Review Letters
- 1985