This is the classic misunderstanding of compression: Use the open parameter of UTM choice to move more of the Kolmogorov Complexity into the UTM so it doesn't appear in the losslessly compressed text. This is "algorithmic bias" -- another absolutely essential term that has been "overridden" to uselessness by political hysteria recently, rendering it necessary that I promote a radical departure from UTM choice in the form of NOR DCGs.
On Mon, Nov 15, 2021 at 6:54 AM <[email protected]> wrote: > How about this compression algorithm: we have a source code as a string. > We also have a grammar that the source code conforms. If we calculate a > hash of the source code, we get a very short string. Reverse function of > hashing gives us hundreds of combinations representing potential original > strings. Each of those strings may be parsed against the source code > grammar. The first combination (and probably the only one) which parses > against the source code grammar is lossless extracting from the hash string > representing our compressed source code. > *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-M519b6cf85825e3a34d108b76> > ------------------------------------------ Artificial General Intelligence List: AGI Permalink: https://agi.topicbox.com/groups/agi/T5ff6237e11d945fb-M1de94c36ffa5d4de09044731 Delivery options: https://agi.topicbox.com/groups/agi/subscription
