Some years ago I made a version of it that works on formulas in provability logic. That logic is decidable, so you can go ahead and code it, and it’ll solve any decision problem converted into such formulas. The same approach can deal with observations and probability (but can’t deal with other agents or any kind of logical probability). You could say it’s a bit tautological though: once you’ve agreed to convert decision problems into such formulas, you’ve gone most of the way, and FDT is the only answer that works at all.
Interesting! It seems like something like that should be a canonical reference for “let’s enter a problem” e.g. smoking lesion, then “select decision theory”, and out pops the answer. Of course, formalizing the problem seems like the hard part.
Is there a formalization of FDT that can be fed into a computer rather than argued about by fallible humans?
Some years ago I made a version of it that works on formulas in provability logic. That logic is decidable, so you can go ahead and code it, and it’ll solve any decision problem converted into such formulas. The same approach can deal with observations and probability (but can’t deal with other agents or any kind of logical probability). You could say it’s a bit tautological though: once you’ve agreed to convert decision problems into such formulas, you’ve gone most of the way, and FDT is the only answer that works at all.
Interesting! It seems like something like that should be a canonical reference for “let’s enter a problem” e.g. smoking lesion, then “select decision theory”, and out pops the answer. Of course, formalizing the problem seems like the hard part.