Category Archives: Turing Machines

Re: Scott Aaronson • The Busy Beaver Frontier Dear Scott, This discussion inspired me to go back and look at some of the work I did in the late 80s when I was trying to understand Cook’s Theorem.  One of … Continue reading →

Re: R.J. Lipton and K.W. Regan • Proving Cook’s Theorem Synchronicity Rules❢ I just started reworking an old exposition of mine on Cook’s Theorem, where I borrowed the Parity Function example from Wilf (1986), Algorithms and Complexity, and translated it … Continue reading →