News for hackers. Stuff that matters.
Re:Kolmogorov Complexity and Compression Distance by tromp on Monday April 01, 2024 @05:53AM (#39892372)
> It therefore cannot be used to define a universal complexity for any string.

It defines a complexity for anything which can be represented in binary. Which in practice is all we want. Who wants to define a new complexity measure for every new alphabet of symbols?

There are no comments on this comment yet.