# SUDT: A toy decision theory for updateless anthropics

The best approach I know for thinking about anthropic problems is Wei Dai's [Updateless Decision Theory](http://wiki.lesswrong.com/wiki/Updateless_decision_theory) (UDT). We aren't yet able to solve all problems that we'd like to—for example, when it comes to game theory, the only games we have any idea how to solve are very symmetric ones—but for many anthropic problems, UDT gives the obviously correct solution. However, UDT is somewhat underspecified, and [cousin_it's concrete models of UDT](http://wiki.lesswrong.com/wiki/Ambient_decision_theory) based on formal logic are rather heavyweight if all you want is to figure out the solution to a simple anthropic problem.

In this post, I introduce a toy decision theory, _Simple Updateless Decision Theory_ or SUDT, which is most definitely not a replacement for UDT but makes it easy to formally model and solve the kind of anthropic problems that we usually apply UDT to. (And, of course, it gives the same solutions as UDT.) I'll illustrate this with a few examples.

This post is a bit boring, because all it does is to take a bit of math that we already implicitly use all the time when we apply updateless reasoning to anthropic problems, and spells it out in excruciating detail. If you're already well-versed in that sort of thing, you're not going to learn much from this post. The reason I'm posting it anyway is that there are things I want to say about updateless anthropics, with a bit of simple math here and there, and while the math may be intuitive, the best thing I can point to in terms of details are the posts on UDT, which contain lots of irrelevant complications. So the main purpose of this post is to save people from having to reverse-engineer the simple math of SUDT from the more complex / less well-specified math of UDT.

(I'll also argue that Psy-Kosh's non-anthropic problem is a type of counterfactual mugging, I'll use the concept of [l-zombies](/lw/jkm/lzombies_lzombies/) to explain why UDT's response to this problem is correct, and I'll explain why this argument still works if there aren't any l-zombies.)

*

I'll introduce SUDT by way of a first example: **the [counterfactual mugging](http://wiki.lesswrong.com/wiki/Counterfactual_mugging)**. In my preferred version, Omega appears to you and tells you that it has thrown a very biased coin, which had only a 1/1000 chance of landing heads; however, in this case, the coin has in fact fallen heads, which is why Omega is talking to you. It asks you to choose between two options, (H) and (T). If you choose (H), Omega will create a Friendly AI; if you choose (T), it will destroy the world. However, there is a catch: Before throwing the coin, Omega made a prediction about which of these options you would choose if the coin came up heads (and it was able to make a highly confident prediction). If the coin had come up tails, Omega would have destroyed the world if it's predicted that you'd choose (H), and it would have created a Friendly AI if it's predicted (T). (Incidentally, if it hadn't been able to make a confident prediction, it would just have destroyed the world outright.)

|     | Coin falls **heads** (chance = 1/1000) | Coin falls **tails** (chance = 999/1000) |
| --- | --- | --- |
| You choose **(H)** if coin falls heads | Positive intelligence explosion | Humanity wiped out |
| You choose **(T)** if coin falls heads | Humanity wiped out | Positive intelligence explosion |

In this example, we are considering two possible worlds: ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Ctext%7Bheads%7D) and ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Ctext%7Btails%7D). We write ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5COmega) (no pun intended) for the set of all possible worlds; thus, in this case, ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5COmega%20=%20%5C%7B%5Ctext%7Bheads%7D,%5Ctext%7Btails%7D%5C%7D). We also have a probability distribution over ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5COmega), which we call ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cmathbb%7BP%7D). In our example, ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Ctextstyle%5Cmathbb%7BP%7D%28%5Ctext%7Bheads%7D%29%20=%20%5Cfrac%7B1%7D%7B1000%7D) and ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Ctextstyle%5Cmathbb%7BP%7D%28%5Ctext%7Btails%7D%29%20=%20%5Cfrac%7B999%7D%7B1000%7D).

In the counterfactual mugging, there is only one situation you might find yourself in in which you need to make a decision, namely when Omega tells you that the coin has fallen heads. In general, we write ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cmathcal%7BI%7D) for the set of all possible situations in which you might need to make a decision; the ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cmathcal%7BI%7D) stands for the _information_ available to you, including both sensory input and your memories. In our case, we'll write ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cmathcal%7BI%7D%20=%20%5C%7B*%5C%7D), where ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=*) is the single situation where you need to make a decision.

For every ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=i%5Cin%5Cmathcal%7BI%7D), we write ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cmathcal%7BA%7D%28i%29) for the set of possible _actions_ you can take if you find yourself in situation ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=i). In our case,![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cmathcal%7BA%7D%28*%29%20=%20%5C%7B%28%5Cmathrm%20H%29,%28%5Cmathrm%20T%29%5C%7D). A _policy_ (or "plan") is a function ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cpi%28i%29) that associates to every situation ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=i%5Cin%5Cmathcal%7BI%7D) an action ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cpi%28i%29%5Cin%5Cmathcal%7BA%7D%28i%29) to take in this situation. We write ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5CPi) for the set of all policies. In our case, ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5CPi%20=%20%5C%7B%5Cpi_H,%5Cpi_T%5C%7D), where ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cpi_H%28*%29%20=%20%28%5Cmathrm%20H%29) and ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cpi_T%28*%29%20=%20%28%5Cmathrm%20T%29).

Next, there is a set of _outcomes_, ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cmathcal%7BO%7D), which specify all the features of what happens in the world that make a difference to our final goals, and the _outcome function_ ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=o%20:%20%5COmega%5Ctimes%5CPi%5Cto%5Cmathcal%7BO%7D), which for every possible world ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Comega%5Cin%5COmega) and every policy ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cpi%5Cin%5CPi) specifies the outcome ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=o%28%5Comega,%5Cpi%29%5Cin%5Cmathcal%7BO%7D) that results from executing ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cpi) in the world ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Comega). In our case, ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cmathcal%7BO%7D%20=%20%5C%7B%28%2B%29,%28-%29%5C%7D) (standing for FAI and DOOM), and ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=o%28%5Ctext%7Bheads%7D,%5Cpi_H%29%20=%20o%28%5Ctext%7Btails%7D,%5Cpi_T%29%20=%20%28%2B%29) and ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=o%28%5Ctext%7Bheads%7D,%5Cpi_T%29%20=%20o%28%5Ctext%7Btails%7D,%5Cpi_H%29%20=%20%28-%29).

Finally, we have a _utility function_ ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=u%20:%20%5Cmathcal%7BO%7D%5Cto%5Cmathbb%7BR%7D). In our case, ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=u%28%28-%29%29%20=%200) and ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=u%28%28%2B%29%29%20=%201). (The exact numbers don't really matter, as long as ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=u%28%28%2B%29%29%20%3E%20u%28%28-%29%29), because utility functions don't change their meaning under affine transformations, i.e. when you add a constant to all utilities or multiply all utilities by a positive number.)

Thus, **an SUDT decision problem consists of the following ingredients:** The sets ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5COmega), ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cmathcal%7BI%7D) and ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cmathcal%7BO%7D) of possible worlds, situations you need to make a decision in, and outcomes; for every ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=i%5Cin%5Cmathcal%7BI%7D), the set ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cmathcal%7BA%7D%28i%29) of possible actions in that situation; the probability distribution ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cmathbb%7BP%7D); and the outcome and utility functions ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=o%20:%20%5COmega%5Ctimes%5CPi%5Cto%5Cmathcal%7BO%7D) and ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=u%20:%20%5Cmathcal%7BO%7D%5Cto%5Cmathbb%7BR%7D). SUDT then says that you should choose a policy ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cpi%5Cin%5CPi) that maximizes the expected utility ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cmathbb%7BE%7D%5Bu%28o%28%5Cboldsymbol%7B%5Comega%7D,%5Cpi%29%29%5D), where ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cmathbb%7BE%7D) is the expectation with respect to ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cmathbb%7BP%7D), and ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cboldsymbol%7B%5Comega%7D%5Cin%5COmega) is the true world.

In our case, ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cmathbb%7BE%7D%5Bu%28o%28%5Cboldsymbol%7B%5Comega%7D,%5Cpi%29%29%5D) is just the probability of the good outcome ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%28%2B%29), according to the (prior) distribution ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cmathbb%7BP%7D). For ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cpi%20=%20%5Cpi_H), that probability is 1/1000; for ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cpi%20=%20%5Cpi_T), it is 999/1000. Thus, SUDT (like UDT) recommends choosing (T).

If you set up the problem in SUDT like that, it's kind of hidden why you could possibly think that's _not_ the right thing to do, since we aren't distinguishing situations ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=i%5Cin%5Cmathcal%7BI%7D) that are "actually experienced" in a particular possible world ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Comega%5Cin%5COmega); there's nothing in the formalism that reflects the fact that Omega never asks us for our choice if the coin comes up tails. In [my post on l-zombies](/lw/jkm/lzombies_lzombies/), I've argued that this makes sense because even if there's no version of you that actually consciously experiences being in the heads world, this version still exists as a Turing machine and the choices that it makes influence what happens in the real world. If all mathematically possible experiences exist, so that there _aren't_ any l-zombies, but some experiences are "experienced more" (have more "magical reality fluid") than others, the argument is even clearer—even if there's some anthropic sense in which, upon being told that the coin fell heads, you can conclude that you should assign a high probability of being in the heads world, _the same version of you still exists in the tails world_, and its choices influence what happens there. And if everything is experienced to the same degree (no magical reality fluid), the argument is clearer still.

*

From Vladimir Nesov's counterfactual mugging, let's move on to what I'd like to call **Psy-Kosh's probably counterfactual mugging**, better known as [**Psy-Kosh's non-anthropic problem**](/lw/3dy/solve_psykoshs_nonanthropic_problem/). This time, you're not alone: Omega gathers you together with 999,999 other advanced rationalists, all well-versed in anthropic reasoning and SUDT. It places each of you in a separate room. Then, as before, it throws a very biased coin, which has only a 1/1000 chance of landing heads. If the coin _does_ land heads, then Omega asks all of you to choose between two options, (H) and (T). If the coin falls _tails_, on the other hand, Omega chooses one of you at random and asks that person to choose between (H) and (T). If the coin lands heads and you all choose (H), Omega will create a Friendly AI; same if the coin lands tails, and the person who's asked chooses (T); else, Omega will destroy the world.

|     | Coin falls **heads** (chance = 1/1000) | Coin falls **tails** (chance = 999/1000) |
| --- | --- | --- |
| Everyone chooses **(H)** if asked | Positive intelligence explosion | Humanity wiped out |
| Everyone chooses **(T)** if asked | Humanity wiped out | Positive intelligence explosion |
| Different people choose differently | Humanity wiped out | (Depends on who is asked) |

We'll assume that all of you prefer a positive FOOM over a gloomy DOOM, which means that all of you have the same values as far as the outcomes of this little dilemma are concerned: ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cmathcal%7BO%7D%20=%20%5C%7B%28%2B%29,%28-%29%5C%7D), as before, and all of you have the same utility function, given by ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=u%28%28-%29%29%20=%200) and ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=u%28%28%2B%29%29%20=%201). As long as that's the case, we can apply SUDT to find a sensible policy for everybody to follow (though when there is more than one optimal policy, and the different people involved can't talk to each other, it may not be clear how one of the policies should be chosen).

This time, we have a million different people, who can in principle each make an independent decision about what to answer if Omega asks them the question. Thus, we have ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cmathcal%7BI%7D%20=%20%5C%7B1,\dotsc,10^6%5C%7D). Each of these people can choose between (H) and (T), so ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cmathcal%7BA%7D%28i%29%20=%20%5C%7B%28%5Cmathrm%20H%29,%28%5Cmathrm%20T%29%5C%7D) for every person ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=i%5Cin%5Cmathcal%7BI%7D), and a policy ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cpi) is a function that returns either (H) or (T) for every ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=i%5Cin%5Cmathcal%7BI%7D). Obviously, we're particularly interested in the policies ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cpi_H) and ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cpi_T) satisfying ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cpi_H%28i%29%20=%20%28%5Cmathrm%20H%29) and ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cpi_T%28i%29%20=%20%28%5Cmathrm%20T%29) for all ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=i).

The possible worlds are ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5COmega%20=%20%5C%7B%5Ctext%7Bheads%7D,(%5Ctext%7Btails%7D,1),\dotsc,(%5Ctext%7Btails%7D,10^6)%5C%7D), and their probabilities are ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Ctextstyle%5Cmathbb%7BP%7D%28%5Ctext%7Bheads%7D%29%20=%20%5Cfrac%7B1%7D%7B1000%7D) and ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Ctextstyle%5Cmathbb%7BP%7D%28(%5Ctext%7Btails%7D,i)%29%20=%20%5Cfrac%7B999%7D%7B1000%7D%5Ccdot10^%7B-6%7D). The outcome function is as follows: ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=o%28%5Ctext%7Bheads%7D,%5Cpi_H%29%20=%20%28%2B%29), ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=o%28%5Ctext%7Bheads%7D,%5Cpi%29%20=%20%28-%29) for ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=\pi\neq\pi_H), ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=o((\mathrm{tails},i),\pi)=(%2B)) if ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=\pi(i)=(\mathrm{T})), and ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=o%28%28%5Cmathrm%7Btails%7D,i%29,%5Cpi%29=%28-%29) otherwise.

What does SUDT recommend? As in the counterfactual mugging, ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cmathbb%7BE%7D%5Bu%28o%28%5Cboldsymbol%7B%5Comega%7D,%5Cpi%29%29%5D) is the probability of the good outcome ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%28%2B%29), under policy ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cpi). For ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cpi%20=%20%5Cpi_H), the good outcome can only happen if the coin falls heads: in other words, with probability ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cfrac%7B1%7D%7B1000%7D). If ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cpi%20\neq%20%5Cpi_H), then the good outcome can _not_ happen if the coin falls heads, because in that case everybody gets asked, and at least one person chooses (T). Thus, in this case, the good outcome will happen only if the coin comes up tails and the randomly chosen person answers (T); this probability is ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cfrac%7B999%7D%7B1000%7D\cdot n\cdot10^{-6}), where ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=n) is the number of people answering (T). Clearly, this is maximized for ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cpi%20=%20%5Cpi_T), where ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=n=10^6); moreover, in this case we get the probability ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cfrac%7B999%7D%7B1000%7D>%5Cfrac%7B1%7D%7B1000%7D), which is better than for ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%20%5Cpi_H), so SUDT recommends the plan ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%20%5Cpi_T).

Again, when you set up the problem in SUDT, it's not even obvious why anyone might think this _wasn't_ the correct answer. The reason is that if Omega asks you, and you update on the fact that you've been asked, then after updating, you are quite certain that the coin has landed _heads_: yes, your prior probability was only 1/1000, but if the coin has landed tails, the chances that _you_ would be asked was only one in a million, so the posterior odds are about 1000:1 in favor of heads. So, you might reason, it would be best if everybody chose (H); and moreover, all the people in the other rooms will reason the same way as you, so if you choose (H), they will as well, and this maximizes the probability that humanity survives. This relies on the fact that the others will choose the same way as you, but since you're all good rationalists using the same decision theory, that's going to be the case.

But in the worlds where the coin comes up tails, and Omega chooses someone else than you, the version of you that gets asked for its decision still "exists"... as an l-zombie. You might think that what this version of you does or doesn't do doesn't influence what happens in the real world; but if we accept the argument from the previous paragraph that your decisions are "linked" to those of the other people in the experiment, then they're _still_ linked if the version of you making the decision is an l-zombie: If we see you as a Turing machine making a decision, that Turing machine should reason, "If the coin came up tails and someone else was chosen, then I'm an l-zombie, but the person who is actually chosen will reason exactly the same way I'm doing now, and will come to the same decision; hence, my decision influences what happens in the real world even in this case, and I can't do an update and just ignore those possible worlds."

I call this the "probably counterfactual mugging" because in the counterfactual mugging, you are making your choice because of its benefits in a possible world that is _ruled out_ by your observations, while in the probably counterfactual mugging, you're making it because of its benefits in a set of possible worlds that is made _very improbable_ by your observations (because _most_ of the worlds in this set are ruled out). As with the counterfactual mugging, this argument is just all the stronger if there are no l-zombies because all mathematically possible experiences are in fact experienced.

*

As a final example, let's look at what I'd like to call [**Eliezer's anthropic mugging**](/lw/17c/outlawing_anthropics_an_updateless_dilemma/): the anthropic problem that inspired Psy-Kosh's non-anthropic one. This time, you're alone again, except that there's many of you: Omega is creating a million copies of you. It flips its usual very biased coin, and if that coin falls heads, it places all of you in exactly identical green rooms. If the coin falls tails, it places _one_ of you in a green room, and all the others in red rooms. It then asks all copies in green rooms to choose between (H) and (T); if your choice agrees with the coin, FOOM, else DOOM.

|     | Coin falls **heads** (chance = 1/1000) | Coin falls **tails** (chance = 999/1000) |
| --- | --- | --- |
| Green roomers choose **(H)** | Positive intelligence explosion | Humanity wiped out |
| Green roomers choose **(T)** | Humanity wiped out | Positive intelligence explosion |

Our possible worlds are back to being ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5COmega%20=%20%5C%7B%5Ctext%7Bheads%7D,%5Ctext%7Btails%7D%5C%7D), with probabilities ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Ctextstyle%5Cmathbb%7BP%7D%28%5Ctext%7Bheads%7D%29%20=%20%5Cfrac%7B1%7D%7B1000%7D) and ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Ctextstyle%5Cmathbb%7BP%7D%28%5Ctext%7Btails%7D%29%20=%20%5Cfrac%7B999%7D%7B1000%7D). We are also back to being able to make a choice in only one particular situation, namely when you're a copy in a green room: ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cmathcal%7BI%7D%20=%20%5C%7B*%5C%7D). Actions are ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cmathcal%7BA%7D%28*%29%20=%20%5C%7B%28%5Cmathrm%20H%29,%28%5Cmathrm%20T%29%5C%7D), outcomes ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=%5Cmathcal%7BO%7D%20=%20%5C%7B%28%2B%29,%28-%29%5C%7D), utilities ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=u%28%28-%29%29%20=%200) and ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=u%28%28%2B%29%29%20=%201), and the outcome function is given by ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=o%28%5Ctext%7Bheads%7D,%5Cpi_H%29%20=%20o%28%5Ctext%7Btails%7D,%5Cpi_T%29%20=%20%28%2B%29) and ![](http://s0.wp.com/latex.php?bg=ffffff&fg=000000&s=0&latex=o%28%5Ctext%7Bheads%7D,%5Cpi_T%29%20=%20o%28%5Ctext%7Btails%7D,%5Cpi_H%29%20=%20%28-%29). In other words, from SUDT's perspective, this is _exactly identical_ to the situation with the counterfactual mugging, and thus the solution is the same: Once more, SUDT recommends choosing (T).

On the other hand, the reason why someone might think that (H) could be the right answer is closer to that for Psy-Kosh's probably counterfactual mugging: After waking up in a green room, what should be your posterior probability that the coin has fallen heads? Updateful anthropic reasoning says that you should be quite sure that it has fallen heads. If you plug those probabilities into an expected utility calculation, it comes out as in Psy-Kosh's case, heavily favoring (H).

But even if these are good probabilities to assign epistemically (to satisfy your curiosity about what the world probably looks like), in light of the arguments from the counterfactual and the probably counterfactual muggings (where updating _definitely_ is the right thing to do epistemically, but plugging these probabilities into the expected utility calculation gives the wrong result), it doesn't seem strange to me to come to the conclusion that choosing (T) is correct in Eliezer's anthropic mugging as well.