Category Archives: Cook’s Theorem

Differential Analytic Turing Automata : 1

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

Posted in Automata, Boolean Functions, C.S. Peirce, Cactus Graphs, Computational Complexity, Computer Science, Cook's Theorem, Differential Analytic Turing Automata, Differential Logic, Logic, Logical Graphs, Peirce, Propositional Calculus | Tagged , , , , , , , , , , , , | 2 Comments