Rule 110 Marble Computer

The rule 110 cellular automaton often simply rule 110 is an elementary cellular automaton with interesting behavior on the boundary between stability and chaos.

Rule 110 marble computer.

Took a bit longer than expected to pull this together but here it is. The input or previous generation is on the lower row of. Rule 110 wikipedia the free encyclopedia a simple math that observes each 3 adjacent bits in a row and makes the center bit below be 1 of the bits from baseten 110 as a base 2 number which is how all 256 rules work by their own logic on 3 1 bits at a time but so far only rule 110 and its mirrors is known to be a general computer. Basically there is a way to convert or compile a tm to a tag system known to be tm complete and then compile a tag system into rule 110.

See tcs se initial conditions for rule 110 for a sketch some refs. The details are complex and contained in scientific papers. In this respect it is similar to conway s game of life like life rule 110 is known to be turing complete this implies that in principle any calculation or computer program can be simulated using this automaton. Apologies for the bits i get a bit ramble y but i didn t script the video.