Difference between revisions of "Pascal's mugging"
|Line 21:||Line 21:|
*[[Shut up and multiply]]
*[[Shut up and multiply]]
|Line 48:||Line 50:|
Revision as of 11:25, 15 March 2012
Now suppose someone comes to me and says, "Give me five dollars, or I'll use my magic powers from outside the Matrix to run a Turing machine that simulates and kills 3^^^^3 people."
If an agent's utilities over outcomes can potentially grow much faster than the probability of those outcomes diminishes, then it will be dominated by tiny probabilities of hugely important outcomes. The prior over computable universes in Solomonoff induction seems to have this problem in particular - more generally, if prior probability goes as simplicity of physical law, then small increases in complexity can correspond to enormous increases in the size of even a finite universe.
Intuitively, one is not inclined to acquiesce to the mugger's demands - or even pay all that much attention one way or another - but what kind of prior does this imply?
Robin Hanson has suggested penalizing the prior probability of hypotheses which argue that we are in a surprisingly unique position to affect large numbers of other people who cannot symmetrically affect us. Since only one in 3^^^^3 people can be in a unique position to ordain the existence of at least 3^^^^3 other people who are not symmetrically in such a situation themselves, the prior probability would be penalized by a factor on the same order as the utility.
Peter de Blanc has proven that if an agent assigns a finite probability to all computable hypotheses (which probability may be computable, or computably bounded below) and assigns unboundedly large finite utilities over percept sequences (that is, the utilities are a direct function of sensory information, not over possible external universes that could be responsible for the sensory percepts; and these utilities are computable, or computably bounded below) then the sum in the expected utility formula does not converge.
Peter de Blanc's paper, and the Pascal's Mugging argument, are sometimes misinterpreted as showing that any agent with an unbounded finite utility function over outcomes is not consistent, but this has yet to be demonstrated.
- Decision theory
- Counterfactual mugging
- Shut up and multiply
- Expected utility
- Scope insensitivity
- Peter de Blanc (2007). Convergence of Expected Utilities with Algorithmic Probability Distributions. http://arxiv.org/abs/0712.4318.
- Nick Bostrom (2009). "Pascal's Mugging". Analysis 69 (3): 443-445. (PDF)