![]() ![]() There is always a small consolation prize in the second box. If Ω predicts you will one-box, it had put a large prize in that first box otherwise that box is empty. In the Newcomb problem, there is a predictor Ω who leaves two boxes, and predicts whether you will take one ("one-box") or both ("two-box"). ![]() ![]() Defining ACDT CDT and the Newcomb problem The drawback is its lack of elegance the advantage, if it works, is that it's simple to specify and focuses attention on the important aspects of deducing the graph. It is, essentially, CDT which can draw extra, acausal arrows on the causal graphs, and which attempts to figure out which graph represents the world it's in. Inspired by my post on problems with causal decision theory (CDT), here is a hacked version of CDT that seems to be able to imitate timeless decision theory (TDT) and functional decision theory (FDT), as well as updateless decision theory (UDT) under certain circumstances.Ĭall this ACDT, for (a)causal decision theory. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |