Tit for tat
rustompmody at gmail.com
Wed Apr 29 03:33:22 CEST 2015
On Wednesday, April 29, 2015 at 3:46:24 AM UTC+5:30, John Ladasky wrote:
> I thought that Patrick Grim's analysis was very interesting, showing that the
> Spatialized Iterated Prisoner's Dilemma (SIPD) could emulate the Wireworld
> cellular automaton, which is a Turing-complete system. Thus, the SIPD, a
> seemingly simple system at first glance, includes configurations which are
> formally undecidable in the Gödelian sense. I'm not sure whether Grim proved
> that an SIPD which includes the Tit for Tat strategy could emulate Wireworld,
> but it seems likely that one could be built.
Thanks John for those pointers -- Ive been looking at it with interest.
This area is of some interest to me -- as my last two blog posts would indicate
PS Google groups invites to writing longlines which causes trouble to some
people out here (with historical machines?).
More information about the Python-list