On Monday, November 15, 2021, at 7:53 AM, ivan.moony 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.
Shotgun approach. Gonna be a lossless in there somewhere :) ------------------------------------------ Artificial General Intelligence List: AGI Permalink: https://agi.topicbox.com/groups/agi/T5ff6237e11d945fb-Mbcd3bae4e4a925007846e702 Delivery options: https://agi.topicbox.com/groups/agi/subscription
