"However, there are some model independent typical properties of abstract computational processes that Alice arguably can expect to see. One of them is the fact that computations initially start in a simple state (at least if the computer program has small algorithmic complexity, which is the case here), and compute forever without halting. [...] Then, the corresponding process will tend to look more and more complex over the course of the computation. Indeed, the random input bits (as described under eq. (4) above) will increase the entropy of the machine’s state over time. Moreover, inspection of many simple example, e.g. cellular automata [36], shows that even deterministic computations often exhibit increasing apparent complexity over time."