During the May 46 MIRI workshop on decision theory, I made the following conjecture: If \(\phi\) and \(\psi\) are sentences such that the length of the shortest proof of \(\phi\rightarrow\psi\) is much shorter than the proof of \(\phi\rightarrow\neg\psi\), then \(\psi\) is a legitimate counterfactual consequence of \(\phi\).
You may be thinking that this conjecture seems like it cannot be correct. This is the intuition that most of us shared until we started looking for (and failing to find) good counterexamples. After many failed attempts, we started referring to it as “The Trolljecture.” Multiple people from the workshop are currently working on writing up posts related to it. However, the conjecture is not very formal. The purpose of this post is just to give some background for those posts and to discuss the why we are keeping the conjecture in this informal state.
There are a three ways in which this conjecture is not formal. I do not see a way to make any of these formal without disrupting the spirit of the conjecture.
What do we mean by “legitimate counterfactual consequence”?
What do we mean by “much shorter”?
What do we mean by “length of the shortest proof”?
I will address these issues one at a time. The term “legitimate counterfactual consequence” does not have a formal definition. If it did, many open problems in decision theory and logical uncertainty would be solved. Instead, it is a pointer to a concept that humans seem to have some intuitions about. The best I can do is give some examples of legitimate counterfactual consequence and hope that we are talking about the same cluster of things.
Regardless of whether or not P=NP, “P=NP” is a legitimate counterfactual consequence of “3SAT\(\in\)P,” while “P\(\neq\)NP” is NOT a legitimate counterfactual consequence of “3SAT\(\in\)P.”
In Newcomb’s problem, “The box is empty” is a legitimate counterfactual consequence of “I twobox.” This is true regardless of whether or not I am a twoboxer.
Note that just because \(\phi\rightarrow \psi\), it does not necessarily follow that \(\psi\) is a legitimate counterfactual consequence of \(\phi\).
In this post, the notation \(\psi\in C(\phi)\) is used for “\(\psi\) is a legitimate counterfactual consequence of \(\phi\).” They mean the same thing.
The term “much shorter” probably could have been defined but most ways to define it seem arbitrary, and the exact definition does not matter much. There are some ways to define it which feel less arbitrary. We could just say that there exists a computable function \(f\) for which the conjecture is true if we define much shorter by “\(n\) is much shorter than anything greater than \(f(n)\).” We could even put restrictions on \(f\), like requiring it to be linear. The reason we do not try to formally define “much shorter” this way is that it would stop us from being able to in theory point at one pair of sentences to demonstrate a counterexample. For now, you can think of “much shorter” to mean “half,” and we can reevaluate if a counterexample is found.
The term “length of the shortest proof” is not defined, because I have not specified a formal proof system. This is on purpose. I do not want to allow a counterexample where \(\phi\rightarrow\neg\psi\) is not provable in PA, but has a really short proof in a stronger proof system, and that short proof is exactly why we believe \(\psi\) is not a legitimate counterfactual consequence of \(\phi\).
It is worth pointing out that this conjecture is not a proposed definition of legitimate counterfactual consequences, it only provides sufficient conditions for something being a legitimate counterfactual consequence. Hopefully much more on this will be posted here by various people in the near future.
