  McGee (1991) argues that maximizing expected utility is not mathematically possible even for an ideal computer with limitless memory.  In order to maximize expected utility, we would have to accept any bet we were offered on the truths of arithmetic, and reject any bet we were offered on false sentences in the language of arithmetic.  But arithmetic is undecidable, so no Turing machine can determine whether a given arithmetical sentence is true or false.