Sam Eisenstat produced the following counterexample to a stronger version of the revived trolljecture (one using soundness rather than consistency in the escalated theories):
Take a statement X in the language of PA such that neither X nor ¬X has a short proof (less than length L) in PA+Sound(PA); X can be provably true, provably false, or undecidable in that system.
Define U to equal 10 if X∧A()=a, 0 if ¬X∧A()=a, and 5 if A()≠a.
Define A to equal a if there is a short proof in PA (less than length L) that A()=a→U()=10, and b otherwise. Clearly A()=b and U()=5.
Now I claim that in the formal system PA+Sound(PA)+(A()=a), there is a very short proof of U()=10. And this is the case whether X is true, false, or undecidable!
In order to prove U()=0, take the axiom A()=a. It follows from the definition of A that there is a short proof in PA (less than length L) that A()=a→U()=10. And it follows from the soundness of PA that in fact A()=a→U()=10, and thus U()=10.
On the other hand, we cannot quickly prove U()=0, for if we could, then we could prove ¬X. Things get tricky because we’re using the extra (inconsistent) axiom A()=a, but intuitively, if X is some arithmetical assertion that has nothing to do with the decision problem, then there shouldn’t be any short proof of ¬X in this system either, and so the shortest proof of U()=0 should be at least comparable to length L.
I don’t know, that line of reasoning that U()=10 seems like a pretty clear consequence of PA+Sound(PA)+A()=a, and the lack of a counterfactual for “X is false” doesn’t violate any of my intuitions. It’s just reasoning backwards from “The agent takes action a” to the mathematical state of affairs that must have produced it (there is a short proof of X).
On second thought, the thing that broke the original trolljecture was reasoning backwards from “I take action a” to the mathematical state of affairs that produced it. Making inferences about the mathematical state of affairs in your counterfactuals using knowledge of your own decision procedure does seem to be a failure mode at first glance.
Maybe use the counterfactual of “find-and-replace all instances of X’s source code in the universe program U with action a, and evaluate”? But that wouldn’t work for different algorithms that depend on checking the same math facts. There needs to be some way to go from “X takes action A” to “closely related algorithm Y takes action B”. But that’s just inferring mathematical statements from the combination of actions and knowing X’s decision rule.
I’ll stick with the trolljecture as the current best candidate for “objective” counterfactuals, because reasoning backwards from actions and decision rules a short way into math facts seems needed to handle “logically related” algorithms, and this counterexample looks intuitively correct.
Sam Eisenstat produced the following counterexample to a stronger version of the revived trolljecture (one using soundness rather than consistency in the escalated theories):
Take a statement X in the language of PA such that neither X nor ¬X has a short proof (less than length L) in PA+Sound(PA); X can be provably true, provably false, or undecidable in that system.
Define U to equal 10 if X∧A()=a, 0 if ¬X∧A()=a, and 5 if A()≠a.
Define A to equal a if there is a short proof in PA (less than length L) that A()=a→U()=10, and b otherwise. Clearly A()=b and U()=5.
Now I claim that in the formal system PA+Sound(PA)+(A()=a), there is a very short proof of U()=10. And this is the case whether X is true, false, or undecidable!
In order to prove U()=0, take the axiom A()=a. It follows from the definition of A that there is a short proof in PA (less than length L) that A()=a→U()=10. And it follows from the soundness of PA that in fact A()=a→U()=10, and thus U()=10.
On the other hand, we cannot quickly prove U()=0, for if we could, then we could prove ¬X. Things get tricky because we’re using the extra (inconsistent) axiom A()=a, but intuitively, if X is some arithmetical assertion that has nothing to do with the decision problem, then there shouldn’t be any short proof of ¬X in this system either, and so the shortest proof of U()=0 should be at least comparable to length L.
I don’t know, that line of reasoning that U()=10 seems like a pretty clear consequence of PA+Sound(PA)+A()=a, and the lack of a counterfactual for “X is false” doesn’t violate any of my intuitions. It’s just reasoning backwards from “The agent takes action a” to the mathematical state of affairs that must have produced it (there is a short proof of X).
On second thought, the thing that broke the original trolljecture was reasoning backwards from “I take action a” to the mathematical state of affairs that produced it. Making inferences about the mathematical state of affairs in your counterfactuals using knowledge of your own decision procedure does seem to be a failure mode at first glance.
Maybe use the counterfactual of “find-and-replace all instances of X’s source code in the universe program U with action a, and evaluate”? But that wouldn’t work for different algorithms that depend on checking the same math facts. There needs to be some way to go from “X takes action A” to “closely related algorithm Y takes action B”. But that’s just inferring mathematical statements from the combination of actions and knowing X’s decision rule.
I’ll stick with the trolljecture as the current best candidate for “objective” counterfactuals, because reasoning backwards from actions and decision rules a short way into math facts seems needed to handle “logically related” algorithms, and this counterexample looks intuitively correct.