Category Archives: Differential Analytic Turing Automata

Survey of Differential Logic • 1

Posted on May 11, 2015 by Jon Awbrey

This is a Survey of blog and wiki posts on Differential Logic, material I plan to develop toward a more compact and systematic account. Elements Differential Logic • Introduction Differential Propositional Calculus • Part 1 • Part 2 Differential Logic … Continue reading →

Posted in Amphecks, Animata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Category Theory, Change, Cybernetics, Differential Analytic Turing Automata, Differential Calculus, Differential Logic, Discrete Dynamics, Equational Inference, Frankl Conjecture, Functional Logic, Gradient Descent, Graph Theory, Hologrammautomaton, Indicator Functions, Inquiry Driven Systems, Leibniz, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Surveys, Time, Topology, Visualization, Zeroth Order Logic | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 1 Comment

Differential Analytic Turing Automata • Discussion 1

Posted on October 14, 2013 by Jon Awbrey

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 Algorithms, Boolean Functions, C.S. Peirce, Cactus Graphs, Computational Complexity, Differential Analytic Turing Automata, Differential Logic, Logic, Logical Graphs, Peirce, Propositional Calculus, Turing Machines | Tagged , , , , , , , , , , , | 2 Comments