Comment on Open thread for January 1-7, 2014

Sat, 04 Jan 2014 13:42:57 GMT

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.

Discuss