News for hackers. Stuff that matters.
Re:Langton's ant by sp332 on Wednesday September 03, 2014 @05:16PM (#8265505)
How can it be Turing-complete with only two colors and one state? I thought you needed at least two colors and three states to be Turing-complete. https://en.wikipedia.org/wiki/Wolfram%27s_2-state_3-symbol_T...
Re:Langton's ant by da-bacon on Wednesday September 03, 2014 @10:38PM (#8266510)
2d versus 1d Turing machine apparently. Here is the paper claiming universality: http://www.dim.uchile.cl/~anmoreir/oficial/langton_dam.pdf
Re:Langton's ant by JadeNB on Wednesday September 03, 2014 @10:33PM (#8266500)
I believe that it is the distinction between playing on a 1-dimensional or 2-dimensional grid.

EDIT: Also, as the article that you link points out, while all definitions of Turing machines agree on their power as a class, minimality results like this are quite sensitive to the details of the definition. (In particular, the article seems to hedge its bets by saying that that machine may be the smallest universal machine.)

Re:Langton's ant by Crito on Wednesday September 03, 2014 @10:53PM (#8266544)
Hmm, I'm not convinced that there should be a difference between 1d grids and 2d grids, since 2d grids are countable and can be represented as 1d grids (just spiral out from any tile on the 2d grid and you'll get a 1d grid. The rules for the ant would have to take this into account, but I don't see any reason why they shouldn't be able to).

That's mostly just my intuition though; it is very possible that I am wrong.

Re:Langton's ant by throwaway_yy2Di on Wednesday September 03, 2014 @11:22PM (#8266613)
Sure, but you'd need more internal states to deal with the overhead of that simulation. On a 2D grid "up" is a primitive op; in your 1D spiral, "up" is some complicated function that probably needs unbounded memory of its own to compute (i.e., an explicit pair of grid coordinates, stored as an integer).

(There's a textbook example where you can add auxiliary memory to a (1D) Turing machine, called a "multi-tape" Turing machine. And you can reduce that to a single-tape Turing machine, but at the cost of blowing up the number of states in the finite automaton).

Re:Langton's ant by throwaway_yy2Di on Wednesday September 03, 2014 @10:43PM (#8266520)
In a sense it really has four "states", since the ant remembers which direction it had previously moved. That's implicit in the clockwise/counterclockwise rule.
Re:Langton's ant by burtonlang on Wednesday September 03, 2014 @11:26PM (#8266620)
I would say there are 10 states. Any square can be empty or have an ant, and if the ant is there its direction is known. That gives 5 states of ant presence and direction, and since a square has 2 color states, that's 10 total states.
Re:Langton's ant by throwaway_yy2Di on Wednesday September 03, 2014 @11:32PM (#8266629)
I'm counting "states" as the term's used in (tape) Turing machines, where you distinguish the internal states of the finite automaton (tape head) from the memory states of the unbounded tape (symbols or colors). So this ant would be analogous to a 4-state, 2-color Turing machine. The ant has four possible states; each cell of the grid has two.
Re:Langton's ant by laumars on Thursday September 04, 2014 @05:38AM (#8267336)
What about when the ant reaches the edge of his grid? (this part I couldn't find an explanation for on the wiki)
Re:Langton's ant by throwaway_yy2Di on Thursday September 04, 2014 @05:54AM (#8267364)
The grid has no edges, it's infinite in all directions!
Re:Langton's ant by laumars on Thursday September 04, 2014 @07:50AM (#8267673)
I see. It would be interesting to see this on a finite universe - a curved universe where opposite edges join
Re:Langton's ant by sp332 on Thursday September 04, 2014 @10:03AM (#8268280)
Oh yeah, that's a good point!