Differential Logic • Discussion 3

Re: R.J. LiptonP<NP

Instead of boolean circuit complexity I would look at logical graph complexity, where those logical graphs are constructed from minimal negation operators.

Physics once had a frame problem (complexity of dynamic updating) long before AI did but physics learned to reduce complexity through the use of differential equations and group symmetries (combined in Lie groups).  One of the promising features of minimal negation operators is their relationship to differential operators.  So I’ve been looking into that.  Here’s a link, a bit in medias res, but what I’ve got for now.

Resources

cc: CyberneticsOntolog • Peirce List (1) (2) (3)Structural ModelingSystems Science

This entry was 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 and tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , . Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

This site uses Akismet to reduce spam. Learn how your comment data is processed.