Algorithmic Randomness is quantitative, just as you demand: 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 On Tue, Nov 23, 2021 at 6:02 PM Jim Bromer <[email protected]> wrote: > "Algorithmic Randomness is very clear: > A random string of bits cannot be represented as a program in fewer bits." > > Your definition is opposite of what I would consider to be random - unless > you are defining randomness relative to a special bounded object. Which is > what I was saying. > I realized that my use of the term 'ordering' wasn't general enough since > what I was getting at was more of a generator of values that produced some > kind of programmatic orderings. So if a string of bits could not be > produced by a particular program, then that would be random (relative to > that generative program.) Or if a string of bits could not be used by a > program to represent useful objects (or identify interrelations in the data > for example) by some particular kind of program than those bits could be > said to be entropic relative to that program. All useful data bits were so > dissipated they could not participate in active generation of new reactions > (that might, for example, require more sophisticated data or program > objects). The idea of entropy is also problematic. > *Artificial General Intelligence List <https://agi.topicbox.com/latest>* > / AGI / see discussions <https://agi.topicbox.com/groups/agi> + > participants <https://agi.topicbox.com/groups/agi/members> + > delivery options <https://agi.topicbox.com/groups/agi/subscription> > Permalink > <https://agi.topicbox.com/groups/agi/T5ff6237e11d945fb-M406cc42bdffbba471c6fc930> > ------------------------------------------ Artificial General Intelligence List: AGI Permalink: https://agi.topicbox.com/groups/agi/T682f141cc89b5183-M7b054f57dab9154c3125c078 Delivery options: https://agi.topicbox.com/groups/agi/subscription
