Funny you don't have to actually compress the enwik8 to get your score. Less 
code, compute, and work for me. You need the long arithmetic number but not the 
actual bin number it converts to. ^_^

I tested pretty good my score evaluation. You can even just test in python this 
code:

print(len(bin(15236274)))
print(len(bin(95236274)))
print(len(bin(1523627415236274152362741523627415236274)))

This shows in the first two tests the starting number is the only one that 
affects, by very little, the total bits from the generated comp.txt file my 
code creates. And the 3rd tests shows if you times it by 5 times in length, it 
is 5 times more bits. Sameish for 500 times longer. It nearly doubles. So the 
comp.txt file my code creates can easily (as I am still doing) be translated to 
the actual amount of bits (hence bytes) it is once turned to bin() without 
actually doing the bin(). The above tests show if you tweak them it is really 
all just length based for the comp.txt file. My emulator I do (instead of the 
time taking method bin(comp.txt)) is again this if you want to try it: 
print(len(comp.read()) / 2.40824). It sees the length of comp.txt and knows how 
many bits that equates to.

------------------------------------------
Artificial General Intelligence List: AGI
Permalink: 
https://agi.topicbox.com/groups/agi/T07a18ba3500f01a9-M02984384bbc2d139a2057a57
Delivery options: https://agi.topicbox.com/groups/agi/subscription

Reply via email to