Pascal’s mugging happens when the probability you would assign disregarding manipulation is very low (not a credible threat by normal standards), with the claimed utility being arbitrarily high to offset this. If that is not the case, it’s a non-challenge and is not particularly relevant to our discussion. Does that clarify my original statement?
That makes sense. Whereas my statement roughly meant “Pascal’s wager isn’t about someone writing BusyBeaver(3^^^3)”—that’s not even a decision problem worth mentioning.
That makes sense. Whereas my statement roughly meant “Pascal’s wager isn’t about someone writing BusyBeaver(3^^^3)”—that’s not even a decision problem worth mentioning.