Whoops, you’re right. Now I’m ashamed that my comment got upvoted.
I think the argument may still be made to work by fleshing out the nonstandard notion of “complexity” that I had in my head when writing it :-) Your prior for a given text being true shouldn’t depend only on the text’s K-complexity. For example, the text “A and B and C and D” has the same complexity as “A or B or C or D”, but the former is way less probable. So P(E) and P(H) may have the same term for complexity, but P(H) also gets a “conjunction penalty” that P(E) doesn’t get because people are prey to the conjunction fallacy.
EDIT: this was yet another mistake. Such an argument cannot work because P(E) is obviously much smaller than P(H), because E is a huge mountain of evidence and H is just a little text. When trying to reach the correct answer, we cannot afford to ignore P(E|H).
For simplicity we may assume P(E|H) to be near-certainty: if there is an attention-seeking god, we’d know about it. This leaves P(E) and P(H), and P(H|E) is tiny exactly for the reason you named: P(H) is much smaller than P(E), because H is optimized for meme-spreading to a great extent, which makes for a given complexity (that translates into P(H)) probability of gaining popularity P(E) comparatively much higher.
Thus, just arguing from complexity indeed misses the point, and the real reason for improbability of cultish claims is that they are highly optimized to be cultish claims.
For example, compare with tossing a coin 50 times: the actual observation, whatever that is, will be a highly improbable event, and theoretical prediction from the model of fair coin will be too. But if the observation is highly optimized to attract attention, for example it’s all 50 tails, then theoretical model crumbles, and not because the event you’ve observed is too improbable according to it, but because other hypotheses win out.
Whoops, you’re right. Now I’m ashamed that my comment got upvoted.
I think the argument may still be made to work by fleshing out the nonstandard notion of “complexity” that I had in my head when writing it :-) Your prior for a given text being true shouldn’t depend only on the text’s K-complexity. For example, the text “A and B and C and D” has the same complexity as “A or B or C or D”, but the former is way less probable. So P(E) and P(H) may have the same term for complexity, but P(H) also gets a “conjunction penalty” that P(E) doesn’t get because people are prey to the conjunction fallacy.
EDIT: this was yet another mistake. Such an argument cannot work because P(E) is obviously much smaller than P(H), because E is a huge mountain of evidence and H is just a little text. When trying to reach the correct answer, we cannot afford to ignore P(E|H).
For simplicity we may assume P(E|H) to be near-certainty: if there is an attention-seeking god, we’d know about it. This leaves P(E) and P(H), and P(H|E) is tiny exactly for the reason you named: P(H) is much smaller than P(E), because H is optimized for meme-spreading to a great extent, which makes for a given complexity (that translates into P(H)) probability of gaining popularity P(E) comparatively much higher.
Thus, just arguing from complexity indeed misses the point, and the real reason for improbability of cultish claims is that they are highly optimized to be cultish claims.
For example, compare with tossing a coin 50 times: the actual observation, whatever that is, will be a highly improbable event, and theoretical prediction from the model of fair coin will be too. But if the observation is highly optimized to attract attention, for example it’s all 50 tails, then theoretical model crumbles, and not because the event you’ve observed is too improbable according to it, but because other hypotheses win out.