Comment on Example decision theory problem: "Agent simulates predictor"

Thu, 19 May 2011 18:02:01 GMT

The N < M is necessary to guarantee that the agent predicts the predictor's proof, right?

Yeah. Actually, N must be exponentially smaller than M, so the agent's proofs can completely simulate the predictor's execution.

What happens if the outlined proof is more than N symbols long?

No idea. :-) Maybe the predictor will fail to prove anything, and fall back to filling only one box, I guess? Anyway, the outlined proof is quite short, so the problem already arises for not very large values of N.

Discuss