This isn’t really that important, but do you know if anyone has actually shown in a rigorous way that CDT two-boxes on Newcomb’s problem?
No one has, because CDT isn’t rigorous enough to bring into a proof framework without first disambiguating it, and there is at least one disambiguation that one-boxes and at least one disambiguation that two-boxes.
No one has, because CDT isn’t rigorous enough to bring into a proof framework without first disambiguating it, and there is at least one disambiguation that one-boxes and at least one disambiguation that two-boxes.