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 http://blog.languager.org/2015/04/poverty-universality-structure-0.html http://blog.languager.org/2015/03/cs-history-0.html ------------------------ PS Google groups invites to writing longlines which causes trouble to some people out here (with historical machines?). -- https://mail.python.org/mailman/listinfo/python-list