= 27d567bc2d48d9f40e9ccc20ea370b15)
DanielLC comments on Open Thread, May 19 - 25, 2014 - Less Wrong Discussion
You are viewing a comment permalink. View the original post to see all comments and the full post content.
= 783df68a0f980790206b9ea87794c5b6)
Loading…= b715d02e85f7b3b4ae65ca3d3e450868)
Subscribe to RSS Feed
Powered by Reddit
= f037147d6e6c911a85753b9abdedda8d)
You are viewing a comment permalink. View the original post to see all comments and the full post content.
Comments (289)
I think adding a little meta-probability will help.
Since there's some probability of the sequence being "the most surprising", this would basically mean that several of the most surprising end up with basically the same probability. For example, if it takes n bits of data to define "the most surprising m-bit sequence", then there must be a 2^-n chance of that happening. Since there are 2^m sequences, and the most surprising sequence must have a probability of at most 2^-m, there must be at least 2^(m-n) most surprising sequences.