I mean that using a probability distribution rather than just saying numbers clearly dispels a naive pascal’s mugging. I am open to the possibility that more heavily contrived Pascal’s Muggings may exist that can still exploit an unbounded utility function but I’ll read that paper and see what I think after that.
Edit: From the abstract:
The agent has a utility function on outputs from the environment. We show
that if this utility function is bounded below in absolute value by an unbounded
computable function, then the expected utility of any input is undefined.
This implies that a computable utility function will have convergent expected
utilities iff that function is bounded.
What this sounds like it is saying is that literally any action under an unbounded utility function has undefined utility. In that case it just says that unbounded utility functions are useless from the perspective of decision theory. I’m not sure how it constitutes evidence that the problem of Pascal’s Mugging is unresolved.
I mean that using a probability distribution rather than just saying numbers clearly dispels a naive pascal’s mugging. I am open to the possibility that more heavily contrived Pascal’s Muggings may exist that can still exploit an unbounded utility function but I’ll read that paper and see what I think after that.
Edit: From the abstract:
What this sounds like it is saying is that literally any action under an unbounded utility function has undefined utility. In that case it just says that unbounded utility functions are useless from the perspective of decision theory. I’m not sure how it constitutes evidence that the problem of Pascal’s Mugging is unresolved.