No, I can get $1001,000. If I randomly choose to take one box the first time, then both boxes will contain money the second time, where I might randomly choose to take both.
(Unless randomising devices are all somehow forced to come up with the same result both times)
Hang on a minute though
1 box then 2 box = $1,001,000 1 box then 1 box = $1,000,000 2 box then 2 box = $1,000 2 box then 1 box = $0
$2,002,000 divided by 4 is $500,500. Effectively you're betting a million dollars on two coinflips, the first to get your money back (1-box on the first day) and the second to get $1000 (2-box on the second day). Omega could just use a randomizer if it thinks you will, in which case people would say "Omega always guesses right, unless you use a randomizer. But it's stupid to use one anyway."
Where p is the probability o...
This is equivalent to Newcomb's Problem in the sense that any strategy does equally well on both, where by "strategy" I mean a mapping from info to (probability distributions over) actions.
I suspect that any problem with Omega can be transformed into an equivalent problem with amnesia instead of Omega.
Does CDT return the winning answer in such transformed problems?
Discuss.