It's the output of a Perl program similar to the one in the original post:
for(0..100){print ( (('00') x 1, ('01') x 2, ('10') x 3, ('11') x 4)[rand(10)])}
However, but I've changed the numbers as a challenge to keghnfeem to come up
with the optimal distribution using his purported insight into the application
of Huffman coding to the compression of such bit strings.
Of course, if anyone else wishes to accept this challenge, they may do so by
sending me the distribution jabowery ta gmaildcom.
Warning, it should *not* be assumed that:
* number of bits per token is 2,
* the number of iterations is 100,
* the rand is 10, *nor *that
* I've not deleted an arbitrary number of bits from the beginning and/or the
end
It *should* be assumed that the number of bits per token is between 1 and 16.
Please provide the answer in some reasonable form, ie similar to:
{00 x 1, 01 x 2, 10 x 3, 11 x 4}
or, say
1:00 2:01 3:10 4:11
etc.
------------------------------------------
Artificial General Intelligence List: AGI
Permalink:
https://agi.topicbox.com/groups/agi/T07349206c4d4db02-M7628d02ff642b79b1905e482
Delivery options: https://agi.topicbox.com/groups/agi/subscription
