Hacker News new | ask | show | jobs
by throwaway_yy2Di 4305 days ago
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.
1 comments

What about when the ant reaches the edge of his grid? (this part I couldn't find an explanation for on the wiki)
The grid has no edges, it's infinite in all directions!
I see. It would be interesting to see this on a finite universe - a curved universe where opposite edges join