Work

Universality in Elementary Cellular Automata

Year: 2004
Type: article
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].
Author: Matthew Cook
Language: English
Open Access status: bronze
OpenAlex ID: W2620826411
FWCI: 13.59
Cites: 1
Cited by: 689
Related to: 10