## Animated Logical Graphs • 24

Boolean functions $f : \mathbb{B}^k \to \mathbb{B}$ and different ways of contemplating their complexity are definitely the right ballpark, or at least the right planet, for field-testing logical graphs.

I don’t know much about the Boolean Sensitivity Conjecture but I did run across an enlightening article about it just yesterday and I did once begin an exploration of what appears to be a related question, Péter Frankl’s “Union-Closed Sets Conjecture”.  See the resource pages linked below.

At any rate, now that we’ve entered the ballpark, or standard orbit, of boolean functions, I can skip a bit of dancing around and jump to the next blog post I have on deck.

### 1 Response to Animated Logical Graphs • 24

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