replacing vague as crap TDT with less-vague UDT and UDT2
As I’ve figured out while writing the last few posts, TDT hasn’t been explained well, but it is a genuinely formalizable theory. (You’ll have to trust me until Part III or check the decision-theory mailing list.) But it’s a different theory from ADT and UDT, and the latter ones are preferable.
I mean, I’ve written an algorithm (in the context of the tournament) which does what TDT should do (just as the algorithm in my last post does what CDT should do). The nice part about specifying the context so precisely is that I can dodge many of the hairy issues which come up in practice, and just show the essence of the decision theories.
As I’ve figured out while writing the last few posts, TDT hasn’t been explained well, but it is a genuinely formalizable theory. (You’ll have to trust me until Part III or check the decision-theory mailing list.) But it’s a different theory from ADT and UDT, and the latter ones are preferable.
You mean you have something in mind about how to handle counterfactuals over logically impossible worlds, or simply “I’m not sure it can’t be done”?
I mean, I’ve written an algorithm (in the context of the tournament) which does what TDT should do (just as the algorithm in my last post does what CDT should do). The nice part about specifying the context so precisely is that I can dodge many of the hairy issues which come up in practice, and just show the essence of the decision theories.