We convert
input to a number, and use it as the first number in a
Collatz sequence
(i.e. even n => n / 2, odd n => 3n+1) until the number reaches 1.
Each iteration is drawn as a bit string where 1s are filled and 0s are empty, continuing to the next line and
wrapping back to the top when necessary.
It is unknown if the Collatz sequence reaches 1 for every input, but we know that
generalized Collatz sequences
can be used to perform arbitrary computations and their behavior is therefore undecidable.