<p>There is an article on Langtons ant, published in the 
SCTPLS Newsletter ( Society for Chaos Theory in Psychology &amp; Life Sciences   Vol. 26, No. 2 February 2019 ) It introduces a first order recurrence relation for the cellular automata 'Langtons ant'   A copy can be downloaded from</p>

<p><a href="http://buzwordsalad.com/lit/SCTPLS_LAWE_bw.pdf" rel="nofollow noreferrer">http://buzwordsalad.com/lit/SCTPLS_LAWE_bw.pdf</a></p>

CC BY-SA 4.0
2019-04-25T07:20:01.500Z
2019-04-25T07:20:01.500Z
Chaos
<p>I'm a mathematician currently working on the <a href="https://en.wikipedia.org/wiki/Langton%27s_ant" rel="nofollow">Langton's ant</a> conjecture, just for fun. I have some result but I don't know if they are meaningless.
So that is why I'm asking.</p>

<p>1)
Is there a mathematical proof that the Langton's ant will stay forever on the highway once it's enter in it ?</p>

<p>2)
Is there a proof that for only one initial condition the Langton's ant will always build the highway ? </p>

CC BY-SA 3.0
2016-04-02T15:26:00.367Z
1) a quite informal proof is by "induction on the shape of the highway": after some steps (104 according to Mathworld site) the last portion of the highway is cloned (+2 pixels horizontally and +2 pixels vertically) and the ant is in the same relative position; so if there are no "obstacles" it will grow forever. 2) It is false: many initial conditions we can test generate a highway ...and -indeeed- the conjecture is "Does every finite initial configuration generates a highway?" (we only know, by the Cohen-Kung theorem, that for every finite initial configuration its trajectory is unbounded)
Marzio De Biasi
CC BY-SA 3.0
2016-04-02T18:26:00.083Z
hi, thanks a lot for replying, in the 2nd question I'm referring to the basis of induction for proving the conjecture. If someone already proof if you put one square black  anywhere the ant will make the highway.thanks again ;)
Porufes
CC BY-SA 3.0
2016-04-02T19:46:28.127Z
ok! (you can specify that you're asking if it is known whether the ant always builds a highway if it is started on a board with another active "cell" at an arbitrary position) I'm not aware of such result ... and IMO it could be a nice "intermediate" result by itself; probably there are cases in which when the highway "hits" a block the ant goes back to the "root" of the highway (and the highway itself is messed up) ... I just made a few simulations with a short highway and it happens  :-)
Marzio De Biasi
CC BY-SA 3.0
2016-04-17T18:35:52.207Z
It's a few years old now, but Ian Stewart discusses a possible approach in 'Figments of Reality'.
NietzscheanAI
<computability><turing-machines><cellular-automata>
Langton's ant questions
Porufes
# Langton's ant questions

(Asked by: username_0 on 2016-04-02)

I'm a mathematician currently working on the [Langton's ant](https://en.wikipedia.org/wiki/Langton%27s_ant) conjecture, just for fun. I have some result but I don't know if they are meaningless.
So that is why I'm asking.

1)
Is there a mathematical proof that the Langton's ant will stay forever on the highway once it's enter in it ?

2)
Is there a proof that for only one initial condition the Langton's ant will always build the highway ?

**Tags:** computability, turing-machines, cellular-automata
> **Comments:**
> **username_1**: 1) a quite informal proof is by "induction on the shape of the highway": after some steps (104 according to Mathworld site) the last portion of the highway is cloned (+2 pixels horizontally and +2 pixels vertically) and the ant is in the same relative position; so if there are no "obstacles" it will grow forever. 2) It is false: many initial conditions we can test generate a highway ...and -indeeed- the conjecture is "Does every finite initial configuration generates a highway?" (we only know, by the Cohen-Kung theorem, that for every finite initial configuration its trajectory is unbounded)  
> **username_0**: hi, thanks a lot for replying, in the 2nd question I'm referring to the basis of induction for proving the conjecture. If someone already proof if you put one square black  anywhere the ant will make the highway.thanks again ;)  
> **username_1**: ok! (you can specify that you're asking if it is known whether the ant always builds a highway if it is started on a board with another active "cell" at an arbitrary position) I'm not aware of such result ... and IMO it could be a nice "intermediate" result by itself; probably there are cases in which when the highway "hits" a block the ant goes back to the "root" of the highway (and the highway itself is messed up) ... I just made a few simulations with a short highway and it happens  :-)  
> **username_2**: It's a few years old now, but Ian Stewart discusses a possible approach in 'Figments of Reality'.  

---

## 1 answers

### Answer by username_3 on 2019-04-25. Score: -1

There is an article on Langtons ant, published in the
SCTPLS Newsletter ( Society for Chaos Theory in Psychology & Life Sciences Vol. 26, No. 2 February 2019 ) It introduces a first order recurrence relation for the cellular automata 'Langtons ant' A copy can be downloaded from

<http://buzwordsalad.com/lit/SCTPLS_LAWE_bw.pdf>


---

