= 27d567bc2d48d9f40e9ccc20ea370b15)
pengvado comments on Open thread for January 1-7, 2014 - Less Wrong
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 (142)
A low entropy microstate takes fewer bits to specify once you're given the macrostate to which it belongs, since low entropy macrostates are instantiated by fewer microstates than high entropy ones. But I don't see why that should be the relevant way to determine simplicity. The extra bits are just being smuggled into the macrostate description. If you're trying to simply specify the microstate without any prior information about the macrostate, then it seems to me that any microstate -- low or high entropy -- should take the same number of bits to specify, no?
If you can encode microstate s in n bits, that implies that you have a prior that assigns P(s)=2^-n. The set of all possible microstates is countably infinite. There is no such thing as a uniform distribution over a countably infinite set. Therefore, even the ignorance prior can't assign equal length bitstrings to all microstates.