You can imagine pi for one trivial example. It has infinite details but it's not infinitely interesting. You can map it to infinite boring story (let's say John moves west/east depending on the next binary digit :) ).
Kolmogorov complexity is the formalism around that distinction.
EDIT now that I think about it - if you take PI in binary and interprete it as utf-8 - every single book every written (or that will ever be written) is in there somewhere :) And there are algorithm to calculate PI to arbitrary digit that are pretty simple.
> take PI in binary and interprete it as utf-8 - every single book every written (or that will ever be written) is in there somewhere
It isn’t proven that pi is normal. Also, even if you were to find a book in the sequence of pi, the index of where it starts would (generally) be vastly larger than the book itself.
Kolmogorov complexity is the formalism around that distinction.
EDIT now that I think about it - if you take PI in binary and interprete it as utf-8 - every single book every written (or that will ever be written) is in there somewhere :) And there are algorithm to calculate PI to arbitrary digit that are pretty simple.