It’s easy to see that these examples, being constructed from E, are at most slightly more complex than the simplest possible pair, since they could use the simplest pair to generate E.
Not actually clear. If I had a really long list of factorials (of length n), then perhaps it could be “compressed” in terms of f of 1 through n + a description of f. However, it’s not clear how large n would have to be for this to be, for that description to be shorter. Thus:
Example: The initial conditions are simply E, and L() doesn’t do anything.
Not actually clear. If I had a really long list of factorials (of length n), then perhaps it could be “compressed” in terms of f of 1 through n + a description of f. However, it’s not clear how large n would have to be for this to be, for that description to be shorter. Thus:
is actually simpler, until E is big enough.
I don’t follow?