There are multiple formulations- I picked one that worked for my purposes, in which X has full knowledge of the setup, including the fact that the boxes are prepared before X even enters the room. This rules out some ways of dodging the question.
I claim your variation doesn’t address the hidden assumption that P(predict X | do X) is near unity, given that P(do X | predict X) is near unity. But there’s a stronger objection; Why pick such a contentious example for a primer?
People have cached thoughts about the classic version of the problem, and that’s going to interfere with the point you’re trying to make.
This is nit picking, but in the specific case of Newcomb’s problem, it’s intentionally unclear if your decision affects Omega’s.
There are multiple formulations- I picked one that worked for my purposes, in which X has full knowledge of the setup, including the fact that the boxes are prepared before X even enters the room. This rules out some ways of dodging the question.
I claim your variation doesn’t address the hidden assumption that P(predict X | do X) is near unity, given that P(do X | predict X) is near unity.
But there’s a stronger objection;
Why pick such a contentious example for a primer? People have cached thoughts about the classic version of the problem, and that’s going to interfere with the point you’re trying to make.
According to Wikipedia there are multiple classic formulations, some involving uncertainty and others involving certainty.