An introduction to logical decision theory for everyone else
arbital.com
arbital.com
I don’t understand why the better approach isn’t some kind of type-theoretic style answer - just say that a first-order decision algorithm takes in a problem description and returns a choice, and a second-order one takes in a problem and returns a first-order algorithm
Then say your decision algorithm is a second-order one that argmaxes over which first-order one performs best on the input problem. There’s no logical counter-possibility issues because you’re not having to imagine “what if my algorithm behaved differently”, the fact that it necessarily returns a particular first-order algorithm doesn’t contradict it being able to evaluate them
I should have listened. Now after many online explanations and going deeper into the rabbit hole I'm not ever sure what a number is anymore.
https://www.tandfonline.com/doi/abs/10.1080/1000200309853874...
The paper underlying this discussion is here, by the way, and Eliezer Yudkowsky is an author:
I recommend reading the introduction for philosophers, by the way.
"Fuck you, I'll not play your game and take 1000" seems like a robust heuristic given a finite time on earth and a lot more charlatans trying to fool you than reliable predictors around
[https://www.lesswrong.com/posts/QPhY8Nb7gtT5wvoPH/comparison...]
> A: Again, this is a theory of decisions about logic, not a theory about logical decisions. [...]