<p>the rule 110 initial condition constructions are extremely intricate even for simple computations and generally cannot be constructed by hand. one would generally start with a <em>real/concrete</em> TM [turing machine] built to compute your problem, ie the complete state table (TMs are of course alluded to in thousands of TCS papers but rarely actually built directly). </p>

<p>generally the papers build initial conditions using complex algorithmic conversions to tag systems. the cook paper cited by DE in comments above[1] does improve the simulation time by a polynomial instead of exponential construction. in other words, theres more than one way to create suitable initial conditions. another recent construction with emphasis on regular languages by martinez et al can be found[2]. the authors of the papers generally do not seem to release code they used to construct their paper results [scanning the two papers below], a legitimate complaint that could be made of much research papers in TCS which tend to give short shrift to experimental approaches[3] even as they seem to focus on them. </p>

<p>so once you have the TM alphabet and state table one runs the conversion algorithms <em>described</em> but not really explicitly/manifestly <em>implemented</em> in the papers [because no code is given, only a prose description of the algorithm(s)] which take the TM alphabet and state table as input and then output a tag-system setup and 110 initial tape conditions that simulates the TM. my understanding is that in some cases, an infinite periodic starting "tape" pattern may be required.</p>

<p>in their papers they do not even seem to mention what coding languages they use for their simulations/experiments. they might release code if you contact them directly. therefore wolframs release/publishing of some mathematica code you mention above [nice but now rather dated based on later developments in the area] seems to be an exception in this area. therefore to actually independently construct concrete machines built using these techniques a researcher might have to reimplement the algorithms described in the papers.</p>

<p>footnote: the exact TM problem must be defined with some care because in your case, does a TM that simply erases and outputs 2 to its tape compute 1+1? you probably want a TM that computes $a+b$ and starts with input 1,1 on the tape.</p>

<p>[1] <a href="http://www.complex-systems.com/pdf/15-1-1.pdf" rel="nofollow noreferrer">A concrete view of rule 110 computation</a> by matthew cook</p>

<p>[2] <a href="http://uncomp.uwe.ac.uk/genaro/Papers/Papers_on_CA_files/repCTSR110.pdf" rel="nofollow noreferrer">Reproducing the cyclic tag system
developed by Matthew Cook with
Rule 110 using the phases fi_1</a> by Martinez et al</p>

<p>[3] <a href="https://cstheory.stackexchange.com/questions/524/isexperimental-complexity-theory-being-used-to-solve-open-problems">Is &quot;Experimental Complexity Theory&quot; being used to solve open problems?</a></p>

CC BY-SA 3.0
2012-06-10T16:17:46.137Z
on further thought this response should be clarified. there are other conversions of misc (arbitrary) TMs to tag systems [which are proven turing-complete] that are not covered in these papers. these papers give algorithms to convert _from_ a tag system to rule 110 initial conditions. in the question, a reference is given to wolfram's code that converts a tag system to rule 110 starting conditions. if one wanted to code the a+b algorithm in a tag system and avoid the TM construction step, that would be possible, but few papers seem to construct tag system machines/algorithms from scratch.
vzn
CC BY-SA 3.0
2012-06-06T15:39:07.200Z
2012-06-06T15:39:07.200Z
2017-04-13T12:32:28.117Z
vzn
<p>In <em>A New Kind of Science</em>, Wolfram proves that the Rule 110 cellular automaton can emulate a cyclic tag system, and is therefore a universal computer.</p>

<p>I was wondering what specific initial conditions are used to model basic computations.  For the sake of specificity, my question is--what initial conditions do I have to give Rule 110 if I want to simulate $1 + 1$?</p>

<p><em>Note:</em>  On <a href="http://www.wolframscience.com/nksonline/page-681" rel="nofollow">page 681</a>, Wolfram provides pictures of "black elements" and "white elements" in Rule 110, but it is hard to tell which initial conditions created them.  On <a href="http://www.wolframscience.com/nksonline/page-1116" rel="nofollow">page 1116</a> (in the "Notes" section), he gives Mathematica code to set up the cyclic tag system.  But I want to know specifically which initial conditions will simulate the computation $1 + 1$.</p>

CC BY-SA 3.0
2012-04-05T19:09:18.857Z
My understanding is that the proof is due to Matthew Cook, and was published without credit by Wolfram. Cook outlines his proof in http://www.complex-systems.com/pdf/15-1-1.pdf and he has a more recent paper http://arxiv.org/abs/0906.3248 that also looks helpful in answering your question.
David Eppstein
CC BY-SA 3.0
2012-04-06T10:40:03.053Z
Cook provides as stated in the comment a mechanical proof. Converting both data and code to an initial condition for rule 110.
Sonia
<computability><universal-computation><cellular-automata>
Initial conditions for universal Rule 110
jamaicanworm
# Initial conditions for universal Rule 110

(Asked by: username_0 on 2012-04-05)

In *A New Kind of Science*, Wolfram proves that the Rule 110 cellular automaton can emulate a cyclic tag system, and is therefore a universal computer.

I was wondering what specific initial conditions are used to model basic computations. For the sake of specificity, my question is--what initial conditions do I have to give Rule 110 if I want to simulate $1 + 1$?

*Note:* On [page 681](http://www.wolframscience.com/nksonline/page-681), Wolfram provides pictures of "black elements" and "white elements" in Rule 110, but it is hard to tell which initial conditions created them. On [page 1116](http://www.wolframscience.com/nksonline/page-1116) (in the "Notes" section), he gives Mathematica code to set up the cyclic tag system. But I want to know specifically which initial conditions will simulate the computation $1 + 1$.

**Tags:** computability, universal-computation, cellular-automata

> **Comments:**
> **username_1**: My understanding is that the proof is due to Matthew Cook, and was published without credit by Wolfram. Cook outlines his proof in http://www.complex-systems.com/pdf/15-1-1.pdf and he has a more recent paper http://arxiv.org/abs/0906.3248 that also looks helpful in answering your question.  
> **username_2**: Cook provides as stated in the comment a mechanical proof. Converting both data and code to an initial condition for rule 110.  

---

## 1 answers

### Answer by username_3 on 2012-06-06. Score: 2 | Accepted answer

the rule 110 initial condition constructions are extremely intricate even for simple computations and generally cannot be constructed by hand. one would generally start with a *real/concrete* TM [turing machine] built to compute your problem, ie the complete state table (TMs are of course alluded to in thousands of TCS papers but rarely actually built directly).

generally the papers build initial conditions using complex algorithmic conversions to tag systems. the cook paper cited by DE in comments above[1] does improve the simulation time by a polynomial instead of exponential construction. in other words, theres more than one way to create suitable initial conditions. another recent construction with emphasis on regular languages by martinez et al can be found[2]. the authors of the papers generally do not seem to release code they used to construct their paper results [scanning the two papers below], a legitimate complaint that could be made of much research papers in TCS which tend to give short shrift to experimental approaches[3] even as they seem to focus on them.

so once you have the TM alphabet and state table one runs the conversion algorithms *described* but not really explicitly/manifestly *implemented* in the papers [because no code is given, only a prose description of the algorithm(s)] which take the TM alphabet and state table as input and then output a tag-system setup and 110 initial tape conditions that simulates the TM. my understanding is that in some cases, an infinite periodic starting "tape" pattern may be required.

in their papers they do not even seem to mention what coding languages they use for their simulations/experiments. they might release code if you contact them directly. therefore wolframs release/publishing of some mathematica code you mention above [nice but now rather dated based on later developments in the area] seems to be an exception in this area. therefore to actually independently construct concrete machines built using these techniques a researcher might have to reimplement the algorithms described in the papers.

footnote: the exact TM problem must be defined with some care because in your case, does a TM that simply erases and outputs 2 to its tape compute 1+1? you probably want a TM that computes $a+b$ and starts with input 1,1 on the tape.

[1] [A concrete view of rule 110 computation](http://www.complex-systems.com/pdf/15-1-1.pdf) by matthew cook

[2] [Reproducing the cyclic tag system
developed by Matthew Cook with
Rule 110 using the phases fi\_1](http://uncomp.uwe.ac.uk/genaro/Papers/Papers_on_CA_files/repCTSR110.pdf) by Martinez et al

[3] [Is "Experimental Complexity Theory" being used to solve open problems?](https://cstheory.stackexchange.com/questions/524/isexperimental-complexity-theory-being-used-to-solve-open-problems)

> **Comments:**
> **username_3**: on further thought this response should be clarified. there are other conversions of misc (arbitrary) TMs to tag systems [which are proven turing-complete] that are not covered in these papers. these papers give algorithms to convert _from_ a tag system to rule 110 initial conditions. in the question, a reference is given to wolfram's code that converts a tag system to rule 110 starting conditions. if one wanted to code the a+b algorithm in a tag system and avoid the TM construction step, that would be possible, but few papers seem to construct tag system machines/algorithms from scratch.  

---

