http://xorshammer.com/2008/11/03/how-to-show-that-games-are-hard/ Some things in mathematical logic that I find interesting Wed, 18 Jan 2012 18:13:09 +0000 hourly 1 http://wordpress.com/ http://xorshammer.com/2008/11/03/how-to-show-that-games-are-hard/#comment-299 Sat, 10 Jul 2010 23:10:29 +0000 http://xorshammer.wordpress.com/?p=204#comment-299 Minor nitpick: I’m pretty sure that Conway’s Game of Life is PSPACE complete for a set initial condition on a bounded segment of a lattice. If one has an indefinite lattice it then becomes Turing complete.

]]> http://xorshammer.com/2008/11/03/how-to-show-that-games-are-hard/#comment-163 Thu, 02 Apr 2009 12:58:02 +0000 http://xorshammer.wordpress.com/?p=204#comment-163 [...] excellent cure. Posts I particularly liked: What Happens When You Iterate Gödel’s Theorem?, How to Show that Games are Hard. Possibly related posts: (automatically generated)Carnival of Mathematics #21: Bar-hopping at [...]

]]>