Ah, I see. Then it seems that you are really solving the problem of minimizing the probability that Omega presents this problem in the first place.
What about the scenario, where Omega uses the strategy: Simulate telling the human that they got the answer wrong. Define the resulting answer as wrong, and the other as right.
This is what I modeled.
BTW, if you add a tab in front of each line of your program listing, it will get formatted correctly.
Thanks. Is there an easier way to get a tab into the comment input box than copy paste from an outside editor?
What about the scenario, where Omega uses the strategy: Simulate telling the human that they got the answer wrong. Define the resulting answer as wrong, and the other as right.
In that case it should be modeled like this:
def P(color):
wrong_color = Omega_Predict(S, "you're wrong")
if S("you're wrong") == wrong_color:
outcome = "die"
else:
outcome = "live"
Thanks. Is there an easier way to get a tab into the comment input box than copy paste from an outside editor?
Not that I'm aware of.
According to Ingredients of Timeless Decision Theory, when you set up a factored causal graph for TDT, "You treat your choice as determining the result of the logical computation, and hence all instantiations of that computation, and all instantiations of other computations dependent on that logical computation", where "the logical computation" refers to the TDT-prescribed argmax computation (call it C) that takes all your observations of the world (from which you can construct the factored causal graph) as input, and outputs an action in the present situation.
I asked Eliezer to clarify what it means for another logical computation D to be either the same as C, or "dependent on" C, for purposes of the TDT algorithm. Eliezer answered:
I replied as follows (which Eliezer suggested I post here).
If that's what TDT means by the logical dependency between Platonic computations, then TDT may have a serious flaw.
Consider the following version of the transparent-boxes scenario. The predictor has an infallible simulator D that predicts whether I one-box here [EDIT: if I see $1M]. The predictor also has a module E that computes whether the ith digit of pi is zero, for some ridiculously large value of i that the predictor randomly selects. I'll be told the value of i, but the best I can do is assign an a priori probability of .1 that the specified digit is zero.