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].
No takes yet. Share an insight, caveat, or question.
Matthew Cook (2004) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: