Such a massive number as you mentioned can be compressed because there is a pattern in that bitstream or in the creation of that bitstream. The code 1111111111 is ten bits long yet it says 1024 of something (the pattern).
You can store 4,294,967,296 'A's using basically 4 bytes. Here, the resulting huge number clearly has a pattern. You can store the bitstream '00' (3) along with an iteration count of 6 (code 11), and add half of that (or less than half if uneven number). 00 (3), 01 (4), 11 (6), 010 (9), 110 (13), 0100 (19), 1101 (28), 01011 (42). Here, the resulting huge number doesn't show a pattern. 10 bits stored can run this over 1024 times, and as we seen, 3, 4, 6, 9, 13, 19, 28, 42, 63, 94, 141, 211, ... meaning after just ~10 iterations we already have ~8 bits in length of a generated number. ------------------------------------------ Artificial General Intelligence List: AGI Permalink: https://agi.topicbox.com/groups/agi/T36c83eb0aa31fc55-M342507b3c89df4a4d3fc0d96 Delivery options: https://agi.topicbox.com/groups/agi/subscription
