Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Framing it as compression is reductive (intended). Yes compression of information is a proxy measure of Kolmogorov complexity, however it's really more accurate to say you're accurately mapping the conditional probability distribution, since it's a stochastic machine that produces samples from a distribution, not a literal compressed representation of anything (you have to do work to extract this stuff and it's not 100% in all cases).


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: