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.
- Logical Graphs
- Minimal Negation Operators
- Survey of Animated Logical Graphs
- Survey of Differential Logic
- Survey of Theme One Program