Still was wrong.
This is essentially equivalent to detecting cycles in a directed graph where each node has outdegree of 1. If you hit the same node twice, you've found a cycle.
Conways compression comes to mind, where a simple timing description and some start states can be used to describe a very complex outcome.
The problem is, that for every function computing a irrational number, you got to have the output as input again.
Imagine if it where otherwise, a completely lightweight PI-function, traveling for eternity, for which nothing in the universe could determinate if its going in a loop or going towards a circle constant.
Your max density is 2^bits.
> Conways compression comes to mind, where a simple timing description and some start states can be used to describe a very complex outcome.
Eventually your 'time' number is so big it takes up the entirety of ram, and you can go no further.