= 27d567bc2d48d9f40e9ccc20ea370b15)
Slackson comments on Open Thread, September 30 - October 6, 2013 - Less Wrong
You are viewing a comment permalink. View the original post to see all comments and the full post content.
= 783df68a0f980790206b9ea87794c5b6)
Loading…= b715d02e85f7b3b4ae65ca3d3e450868)
Subscribe to RSS Feed
Powered by Reddit
= f037147d6e6c911a85753b9abdedda8d)
You are viewing a comment permalink. View the original post to see all comments and the full post content.
Comments (295)
TDT performs exactly as well as CDT on the class of problems CDT can deal with, because for those problems it essentially is CDT. So in practice you just use normal CDT algorithms except for when counterfactual copies of yourself are involved. Which is what TDT does.
I argue that there's an mapping in the opposite direction: if you add extra nodes to any problem that looks like a problem where TDT and CDT disagree, and adjust which node is the decision node, then you can make CDT and TDT agree (and CDT give the "TDT solution"). This is obvious in the case of Newcomb's Problem, for example.
I guess it's true that CDT needed lots of ideas to work. TDT has one idea: "link counterfactual decisions together." So it is not an unreasonable view that TDT is an addendum to CDT, and not vice versa, since CDT is intellectually richer.