"Uh, 'robot' is what Civilization calls... Civilization's equivalent of golems, is what I'd like to say, except I know nothing about golems except that 'robot' translates to that."  (The 'Bot' suffix as translated is literally the final syllable of Taldane's word for 'golem'.)

"And we don't literally have 'robots' doing this, probably not literally golems either, it's just - the name for a very simple thing that is maybe more pretending to be a person by following very simple rules, than a real person, if that makes sense."

"In this case, we're not so much looking for a new piece of Law - the Law we're going to use is just Assumable Provability, which almost always ends up true of any proof-system you're not deliberately keeping it out of.  We're looking for a bot that mutually cooperates with itself, mutually cooperates with FairBot, defects against DefectBot, and defects against CooperateBot.  This is the simplest bot that we could say is acting like a shadow, inside this simpler realm, of a bigger and more complicated sane agent that seeks as much copper as possible."

"That bot is made out of pieces like the pieces I've already shown you, plus one more.  The final piece you need is the Provable-1 predicate, where..."

let Provable-1("X") = Provable(" ~Provable(0=1) -> X")

"...and what this means, is that it describes what you can prove assuming that the base system is consistent - that it never proves both a proposition, and its negation.  In this case, what it means is that Provable-1, but not Provable, can prove, for example, that FairBot defects against DefectBot.  Because you need the extra assumption that Provable is consistent, to derive inside Provable that, just because DefectBot always Defects, there's no proof inside Provable that DefectBot Cooperates..."

"Uh, 'robot' is what Civilization calls... Civilization's equivalent of golems, is what I'd like to say, except I know nothing about golems except that 'robot' translates to that."  (The 'Bot' suffix as translated is literally the final syllable of Taldane's word for 'golem'.)

"And we don't literally have 'robots' doing this, probably not literally golems either, it's just - the name for a very simple thing that is maybe more pretending to be a person by following very simple rules, than a real person, if that makes sense."

"In this case, we're not so much looking for a new piece of Law - the Law we're going to use is just Assumable Provability, which almost always ends up true of any proof-system you're not deliberately keeping it out of.  We're looking for a bot that mutually cooperates with itself, mutually cooperates with FairBot, defects against DefectBot, and defects against CooperateBot.  This is the simplest bot that we could say is acting like a shadow, inside this simpler realm, of a bigger and more complicated sane agent that seeks as much copper as possible."

"That bot is made out of pieces like the pieces I've already shown you, plus one more.  The final piece you need is the Provable-1 predicate, where..."

let Provable-1("X") = Provable(" ~Provable(0=1) -> X")

"...and what this means, is that it describes what you can prove assuming that the base system is consistent - that it never proves both a proposition, and its negation.  In this case, what it means is that Provable-1, but not Provable, can prove, for example, that FairBot defects against DefectBot.  You might say that Provable-1 is the proofsystem that trusts Provable."

"This matters, because you need the extra assumption that Provable is consistent, to derive inside Provable that, just because DefectBot always Defects, there's no proof inside Provable that DefectBot Cooperates..."

"Uh, 'robot' is what Civilization calls... Civilization's equivalent of golems, is what I'd like to say, except I know nothing about golems except that 'robot' translates to that."  (The 'Bot' suffix as translated is literally the final syllable of Taldane's word for 'golem'.)

"And we don't literally have 'robots' doing this, probably not literally golems either, it's just - the name for a very simple thing that is pretending to be a person by following very simple rules, if that makes sense."

"In this case, we're not so much looking for a new piece of Law - the Law we're going to use is just Assumable Provability, which almost always ends up true of any proof-system you're not deliberately keeping it out of.  We're looking for a bot under that Law.

We're looking for a bot that mutually cooperates with itself, mutually cooperates with FairBot, defects against DefectBot, and defects against CooperateBot.  This is the simplest bot that we could say is acting like a shadow, inside this simpler realm, of a bigger and more complicated sane agent that seeks as much copper as possible."

"That bot is made out of pieces like the pieces I've already shown you, plus one more.  The final piece you need is the Provable-1 predicate, where..."

let Provable-1("X") = Provable(" ~Provable(0=1) -> X")

"...and what this means, is that it describes what you can prove assuming that the base system is consistent - that it never proves both a proposition, and its negation.  In this case, what it means is that Provable-1, but not Provable, can prove, for example, that FairBot defects against DefectBot.  You might say that Provable-1 is the proofsystem that trusts Provable."

"This matters, because you need the extra assumption that Provable is consistent, to derive inside Provable that, just because DefectBot always Defects, there's no proof inside Provable that DefectBot Cooperates..."