From FairBot to other cooperation conditions by substitution
The simplest interesting player in MIRI's provability bot prisoner's dilemma tournament was FairBot, which cooperates if it can prove its opponent cooperates. It cooperates with another FairBot despite the apparent infinite regress, by Löb's theorem (some might say magic). A related line of work was how to represent statements like "if I take this action, it will have that consequence" in provability logic. For example there's these old slides by Vladimir Slepnev that I came across on the MIRI w...
Read full article →