News for hackers. Stuff that matters.

A comment on Kolmogorov Complexity (2014) [pdf]. Parent comment

Re:Kolmogorov Complexity (2014) [pdf] by mac01021 on Wednesday May 18, 2016 @11:15AM (#11722528)
Sipser's undergraduate textbook on the theory of computation[1] has a single, very nice, introductory chapter on the topic.

If you want to get technical and deep, you probably want [2] (An introduction to Kolmogorov complexity and its applications). It's pretty hard, though. Not for the faint of heart.

[1] http://www.amazon.com/Introduction-Theory-Computation-Michae...

[2] http://www.amazon.com/Introduction-Kolmogorov-Complexity-App...

[ Parent | on HN ]
Re:Kolmogorov Complexity (2014) [pdf] by Chris2048 on Wednesday May 18, 2016 @11:26AM (#11722607)
I did a uni project based on that second book. Despite the title, it's hard to actually get to practical applications.
[ Parent | on HN ]
Re:Kolmogorov Complexity (2014) [pdf] by eli_gottlieb on Wednesday May 18, 2016 @02:28PM (#11724430)
>If you want to get technical and deep, you probably want [2] (An introduction to Kolmogorov complexity and its applications). It's pretty hard, though. Not for the faint of heart.

Basically, learn real analysis first, with emphases on topology and measure theory. Then tackle Kolmogorov complexity theory.

[ Parent | on HN ]