News for hackers. Stuff that matters.
Re:Kolmogorov Complexity and Compression Distance by asplake on Sunday March 31, 2024 @01:52AM (#39881793)
> let’s assume that there exists a universal language U such that it always gives us the shortest description length for all strings.

Read on a bit and it looks like proof by contradiction:

> However, let’s bring back the paradox we discussed above. According to that paradox, U cannot exist or U cannot provide shorter descriptions than every arbitrary L.

There are no comments on this comment yet.