I was looking at the Collatz Conjecture and I thought of something:
If we denote two operators $a_n = 2n$ and $b_n = \frac{n-1}{3}$, then every number that converges using the Collatz Conjecture can be represented in the form of a continued subscript, like 5: $$b_{a_{a_{a_{a_{1}}}}}$$
And to make it easier to read, I'll remove the subscripts, making it:
$$baaaa1$$
If we remove the $1$, giving $baaaa$, and then replace $b$ as $0$ and $a$ as $1$, we get a psuedo-binary system. Thus $5$ is $01111$ and $7$ is $0101011011101111$. The longer it takes for a number to converge, the longer the number is written down.
I realize that this has an information density much much less than binary, but I was wondering: Given this number system, and given two numbers, $x$ and $y$, how can we determine what their sum, $x+y$ will be, or if it will even exist in this number system?