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

If a string produced from random noise gets compressed (because it has invariably some repetitions in it if long enough), is there any prediction? Even getting the probability distributions right doesn't get to any way to reliably to predict the next symbol out of the sample string. Any functions fitted etc. will be incorrect, too.


I believe compressed random noise cannot be shorter in expectation than the original




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

Search: