Well, what do you mean by “setting it up in the real world”? There are certainly versions that can be done on computer (and I’m not sure if you were counting these, so don’t take this as a criticism).
-Write an algorithm A1 for picking whether to one-box or two-box on the problem.
-Write an algorithm A2 for predicting whether a given algorithm will one-box or two-box, and then fill the box as per Omega.
-Run a program in which A2 acts on A1, and then A1 runs, and find A1′s payoff.
Eliezer_Yudkowsky even claimed that this implementation of Newcomb’s problem makes it even clearer why you should use Timeless Decision Theory.
Well, what do you mean by “setting it up in the real world”? There are certainly versions that can be done on computer (and I’m not sure if you were counting these, so don’t take this as a criticism).
-Write an algorithm A1 for picking whether to one-box or two-box on the problem.
-Write an algorithm A2 for predicting whether a given algorithm will one-box or two-box, and then fill the box as per Omega.
-Run a program in which A2 acts on A1, and then A1 runs, and find A1′s payoff.
Eliezer_Yudkowsky even claimed that this implementation of Newcomb’s problem makes it even clearer why you should use Timeless Decision Theory.