On Thursday, November 04, 2021, at 10:48 PM, Matt Mahoney wrote: > Ivan Moony, James Bowery, and Writer of Minds are right. Compression is a > function from the set of all strings to another countably infinite set of > strings. The mapping to the compressed set is either 1 to 1 with an inverse > (lossless) or many to 1 without an inverse (lossy).
That is the best description of the two I've ever seen. The simplest program! Then to demonstrate the existence of lossness non-binary any situations that are potentially not exclusively one or the other can be examined. ------------------------------------------ Artificial General Intelligence List: AGI Permalink: https://agi.topicbox.com/groups/agi/T5ff6237e11d945fb-M962862f21772da348bca1288 Delivery options: https://agi.topicbox.com/groups/agi/subscription
