Universality in Elementary Cellular Automata
Indexed incrossref
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].
Citation impact
688
total citations
- FWCI
- 14.87
- Percentile
- 100%
- References
- 1
Citations per year
Authors
1Topics & keywords
Keywords
- Universality (dynamical systems)
- Cellular automaton
- Computer science
- Elementary cellular automaton
- Automaton
- Theoretical computer science
- Mobile automaton
- Physics
No related works found for this paper.