News for hackers. Stuff that matters.
Re:Why literature is the ultimate big-data challenge by Isamu on Friday March 03, 2017 @12:56PM (#13784680)
Maybe you would find the theory of information interesting:

http://math.harvard.edu/~ctm/home/text/others/shannon/entrop...

Here in his famous tour de force Claude Shannon lays out the way we can estimate the amount of actual information in an act of communication (e.g. a literary work) and relates it to system entropy.

To your point, !TB of all 1's compresses to a just few bits of actual information.

But I suspect you are not actually speaking about the information contained in a literary work. You are probably thinking: how much expansive commentary and explanation could a literary work spawn? That is another question. The answer is always: unbounded.

Re:Why literature is the ultimate big-data challenge by killjoywashere on Friday March 03, 2017 @06:27PM (#13787895)
> The answer is always: unbounded.

But after initial perturbations die out, the growth rate will likely look something like O(log n) or less.