Universality in Elementary Cellular Automata
Complex Systems2004Vol. 15(1), pp. 1–40
Citations Over TimeTop 1% of 2004 papers
Abstract
The purpose of this paper is to prove a conjecture made by Stephen Wolfram in 1985, that an elementary one dimensional cellular automaton known as "Rule 110" is capable of universal computation. I developed this proof of his conjecture while assisting Stephen Wolfram on research for A New Kind of Science [1].
Related Papers
- → On Local Symmetries and Universality in Cellular Automata(2009)14 cited
- A note on the reversibility of the elementary cellular automaton with rule number 90(2015)
- → On Local Symmetries And Universality In Cellular Autmata(2009)4 cited
- → Time-space pattern and dynamics determined by elementary cellular automata(2004)1 cited
- → Computational Universality and 1/f Noise in Elementary Cellular Automata(2013)