Category Archives: Differential Analytic Turing Automata

Survey of Theme One Program • 1

This is a Survey of previous blog and wiki posts on the Theme One Program that I worked on all through the 1980s. The aim of the project was to develop fundamental algorithms and data structures to support an integrated … Continue reading

Posted in Algorithms, Animata, Artificial Intelligence, Automated Research Tools, Boolean Algebra, Boolean Functions, Cactus Graphs, Cognitive Science, Computation, Computational Complexity, Computer Science, Computing, Constraint Satisfaction Problems, Cybernetics, Data Structures, Diagrammatic Reasoning, Diagrams, Differential Analytic Turing Automata, Education, Educational Systems Design, Educational Technology, Equational Inference, Functional Logic, Graph Theory, Indicator Functions, Inquiry, Inquiry Driven Education, Inquiry Driven Systems, Inquiry Into Inquiry, Intelligent Systems, Knowledge, Learning, Learning Theory, Logic, Logical Graphs, Machine Learning, Mathematics, Mental Models, Minimal Negation Operators, Painted Cacti, Peirce, Programming, Programming Languages, Propositional Calculus, Propositional Equation Reasoning Systems, Propositions, Research Technology, Semeiosis, Semiosis, Semiotics, Sign Relations, Surveys, Teaching, Theorem Proving, Triadic Relations | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | Leave a comment

Survey of Differential Logic • 1

This is a Survey of previous blog and wiki posts on Differential Logic, material that I plan to develop toward a more compact and systematic account. Elements Differential Logic • Introduction Differential Propositional Calculus Architectonics Minimal Negation Operator Cactus Language … Continue reading

Posted in Amphecks, Boolean Functions, C.S. Peirce, Cactus Graphs, Change, Computational Complexity, Cybernetics, Differential Analytic Turing Automata, Differential Calculus, Differential Logic, Discrete Dynamical Systems, Equational Inference, Frankl Conjecture, Functional Logic, Graph Theory, Hill Climbing, Hologrammautomaton, Indicator Functions, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Propositional Equation Reasoning Systems, Surveys, Visualization, Zeroth Order Logic | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , | Leave a comment

Differential Analytic Turing Automata : 1

Re: 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 into the cactus graph syntax for … Continue reading

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