Hacker News Reader

I'm missing something or the author could have used: Kolmogovov complexity (0), normalized compression distance (1), some research of Rudy Cilibrasi and Vitaniy, and some research that come after it(2).

(0) https://en.m.wikipedia.org/wiki/Kolmogorov_complexity

(1) https://en.m.wikipedia.org/wiki/Normalized_compression_dista...

(2) for example: https://www.sciencedirect.com/science/article/pii/S037907381...

View on HN

Definitely could not have used Kolmogorov complexity, as it is uncomputable.

Is the article not doing normalized compression distance already? It just finds the closest match instead of the distance, but it seems to be the same algorithm.

Yes, seems to be so, but never mentions it. Kind of reaching the same idea by not knowing previous research. And it might find some old pitfalls, e.g., limits of using zip to do it...

Reply on news.ycombinator.com