# Collatz Problem as a Cellular Automaton

Collatz Problem as a Cellular Automaton

Start with an integer ; 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 in base 6.

n

n