Turing Tumble Community

TT as a cellular automaton

I made a cellular automaton rule that roughly simulates Turing Tumble! It is written as a .rule file that can be used with the free program Golly.

Some notes about this implementation:

  • Golly’s canvas is infinite, so there is no maximum board size. In fact, you can even have multiple boards.
  • There is a limited ability to handle multiple marbles. This is used in the construction of the board shown above. However, if two marbles try to roll into the same space at the same time, one of them will be annihilated.
  • Crossovers secretly double as marble sorters. If you place a marble on top of a crossover, then matching marbles will be reflected instead of being allowed to cross.
  • Due to the “speed of light” of 1 cell per tick, blocks of gearbits may not be simulated properly. The gearbit change can only propogate at the same speed as the marbles, so the marbles can sometimes outrun the change.
  • There are no gears, only gearbits. Not like it matters very much.
  • Bits might look backwards to you. This way makes more sense to me…

Copy the rule from here, and paste it into an open Golly window. Then you can paste in the basic board:

x = 28, y = 72, rule = TuringTumble
5.E5.E5$5.E5.E5$5.E5.E5$5.E5.E5$2.2IH7.I2H5.6C2F$.2IA.D2J.2JC.B2H4.6C
2F$.ICEJ3.J3.JEDH4.6C2F$.2IJ9.J2H4.6C2F$JIJ11.JHJ3.6C2F$.IpI11.pJH4.
6E2I$.IJ11.JH4.4H2J2I$.IJ11.JH4.4HJ$.IJ11.JH$.IpI11.pJH$.IJ11.JH$.IJ
11.JH$.IDJ.J.J.J.J.JCH$.2ID3.CJD3.C2H$2.2ID.C3.D.C2H$3.3I5.3H$5.IC3.D
H$5.I5.H$4.D7.C$5.D5.C$6.D3.C$7.D.C30$8.E!
2 Likes

Wow this is very cool! It will take a while to remember the symbols, but this will be much faster than TT.

What is a cellular automaton? Thanks, Hudson!

A cellular automation is a system with cells that change according to the states of the cell and its neighbors. In this rule, for example, when a cell with no marble is below a cell with a marble, then it changes to a cell with a marble. The most common example of a cellular automaton is Conway’s Game of Life, in which cells turn on if exactly 3 of their neighbors are on, and remain on if either 2 or 3 of their neighbors are on.

Golly is capable of simulating lots of different cellular automata. If you download it, I recommend exploring the built-in examples.

Wow, okay! Thanks, Hudson!