Looks like there are 50 percent zeros and fifty percent ones. Looks completely random? Seed sequences would:
00 01 10 11 And with no fragment seed sequences. A = 0 B =1 Huffman coding, one bit seed compressor, does not work on this level. kolmogorov complextey analysis would be to match, find, bit string fragments of various lengths. The bit length of matching value would and is limited to half the bit length of the given bit file. Like as in the fist half of the file could matches the end half. And two matches within the file would make a valued match. Then it is on to finding periodic distances to each match and then find periodic fragments that match with other fragments and etc. The LZ77 Compression Family (Ep 2, Compressor Head): https://www.youtube.com/watch?v=Jqc418tQDkg A completely random file can produce patterns. But there is threshold it has to pass to become a non or less random bit string. Or parts of it. Life could be a bit stream recorded in to an AGI. Recorded bit pattern are N or NP bit patterns. If universe has a beginning and an end then there could be a bit pattern of the fist half of the universe and then a matching pattern of the other half. So if a AGI machine dies before then end then this pattern is NP. Or AGI does not have enough memory to record the fist half. ------------------------------------------ Artificial General Intelligence List: AGI Permalink: https://agi.topicbox.com/groups/agi/T07349206c4d4db02-M7e8254b647f48ab3d0228e45 Delivery options: https://agi.topicbox.com/groups/agi/subscription
