1) Why "complexity penalty" should work in fiction, even in a rationalist fiction?
Because there will still be an infinite (countable) number of finite hypotheses which could be considered and only a finite amount of probability to divide among them, which necessarily implies that in the limit more complicated hypotheses will have individual probability approaching zero. This will be true in the limit even if you define 'complexity' differently than the person who constructed the distribution.
Is "A or B" more "complex" than "A"? It seems to me that it generally takes more bits to say "A or B", but the prior for "A" should be smaller than for "A or B". Is there something in the "assign prior according to complexity" heuristic that accounts for that?
This is a new thread to discuss Eliezer Yudkowsky’s Harry Potter and the Methods of Rationality and anything related to it. This thread is intended for discussing chapter 96. The previous thread is at almost 300 comments.
There is now a site dedicated to the story at hpmor.com, which is now the place to go to find the authors notes and all sorts of other goodies. AdeleneDawner has kept an archive of Author’s Notes. (This goes up to the notes for chapter 76, and is now not updating. The authors notes from chapter 77 onwards are on hpmor.com.)
The first 5 discussion threads are on the main page under the harry_potter tag. Threads 6 and on (including this one) are in the discussion section using its separate tag system.
Also: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, .
Spoiler Warning: this thread is full of spoilers. With few exceptions, spoilers for MOR and canon are fair game to post, without warning or rot13. More specifically: