From FairBot to other cooperation conditions by substitution

·LessWrong··

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 →

Related Articles

Unauthenticated remote code execution in Nginx
speedping · Hacker News · 6h ago
Highly classified US national security communications network goes down
monkeydust · Hacker News · 1d ago
Harvard researchers find AI coding agents shifted the bottleneck to code review
judahmeek · Hacker News · 1d ago
New Evidence Shows School Phone Bans Are Gradually Improving Test Scores
donohoe · Hacker News · 1d ago
Java4Shell: RCE in OpenJDK when processing Base64
werrett · Hacker News · 1d ago