On Wednesday, November 24, 2021, at 11:40 PM, James Bowery wrote: > Let K be the Kolmogorov Complexity of a bit string and let L be the length of > the bit string. > > The randomness of the bit string is simply: > > K/L
This is just so nice and simple. Just experiment and vary the two… even though the K is mostly incomputable it’s estimable, imaginable, symbolizeable and conceptualizable. ------------------------------------------ Artificial General Intelligence List: AGI Permalink: https://agi.topicbox.com/groups/agi/T682f141cc89b5183-Mc91da7cc7e2094829455e99a Delivery options: https://agi.topicbox.com/groups/agi/subscription
