Thanks for writing this up! I was wondering how this formalization works for Newcomb's problem. (I'll take box A to be the transparent box containing a thousand dollars, and box B to be the opaque box containing a million dollars or nothing.)
I would like to say that the actions are A={‘‘Take only box B",‘‘Take both boxes"}, the states are S={‘‘Box B is full",‘‘Box B is empty"}, and the outcomes O are the four different ways of combining the actions and states.
But it seems like I've violated the definition of a state given in the post:
Thanks for writing this up! I was wondering how this formalization works for Newcomb's problem. (I'll take box A to be the transparent box containing a thousand dollars, and box B to be the opaque box containing a million dollars or nothing.)
I would like to say that the actions are A={‘‘Take only box B",‘‘Take both boxes"}, the states are S={‘‘Box B is full",‘‘Box B is empty"}, and the outcomes O are the four different ways of combining the actions and states.
But it seems like I've violated the definition of a state given in the post:
... (read more)