3 ms·
Clearly some unicode is allowed, but I can't find a good reference as to whether all unicode characters are allowed, or whether each counts equally as one chara
by gojomo 17y ago
Clearly some unicode is allowed, but I can't find a good reference as to whether all unicode characters are allowed, or whether each counts equally as one character against the 140-character limit.
But let's assume 140 bytes is the actual limit. That suggests around 255^140 possible tweets (assuming NULs unused). RFC678 defines a 'logical page' based on the printable area of a letter-sized page as 60 lines of 72 characters each; thus figuring 2 lines per tweet, that's 60 tweets per double-sided page.
So we need (255^140)/60 pages. An unopened ream (500 sheets) of 30lb paper I have is 5cm thick. So the stack of all printed tweets would be ((255^140)/60)×(5cm/500).
WolframAlpha calculates:
http://www86.wolframalpha.com/input/?i=((255^140)%2F60)*(5cm%2F500) http://www86.wolframalpha.com/input/?i=((255^140)%2F60)*(5cm...
= 1.451x10^315 ly (light years)
...and they also helpfully offer a "Comparison as diameter"...
≅ 1.6x10^304 x diameter of the observable universe (≅ 93 billion ly )
So, even with an allowance for the smaller print of commercial publishing, there'd be no place in our universe to put this book. A Kindle version, implemented in a line or two of code, seems more practical.
ObBorges: http://jubal.westnet.com/hyperdiscordia/library_of_babel.html http://jubal.westnet.com/hyperdiscordia/library_of_babel.htm...
- eru 17y agoI propose not storing/generating every possible tweet, put a careful selection: Take a statistical model of tweet/sms-language, say with Markov-Chains, and generate only the tweets that fit the model with a large-enough significance. That should reduce the number to a more manageable level, although a book may be still off limits.
- gojomo 17y agoBut the ones that look like noise are compressed versions of brilliant longer tweets! (If decompression does not yield a suitably brilliant tweet, try another algorithm until the desired level of brilliance and length is achieved. Generation and storage of the algorithms is left as an exercise for the reader; see Kolmogorov.)