This echoes the impossibility-of-optimality results of Anderlini [2] and Canning [6] on game theory for Turning machines with access to each others’ source codes.
Turning → Turing
FairBot references itself in its definition, but as with CliqueBot , this can be done via Kleene’s recursion theorem
Should there be a reference to Kleene’s recursion theorem, or is this common background knowledge for your target audience?
Turning → Turing
Should there be a reference to Kleene’s recursion theorem, or is this common background knowledge for your target audience?
Thanks! Will fix both.