Collatz Problem as a Cellular Automaton

number

27

labels

allow dynamic resizing

Start with an integer

n

; if it is even, divide by two, but if it is odd, triple it and add 1; repeat this process. The Collatz problem asks whether 1 is reached. In all known cases, the sequence always reaches 1, but no proof is known that this is always true. Here is a cellular automaton version of this, writing

n

in base 6.