Notice how divide by two only removes redundant information (namely all leading zeros on the left of the binary string - little endian) therefore f' (corecursive with f(n) = 3n) is the only entropy-adding element of the collatz problem in binary