Combinatorial Complexity

mechanism

When each new component can interact with every existing one, complexity grows through connections, not merely parts. Removing one component can therefore eliminate many possible failures at once.

Add one component to a system and you may create far more than one new problem. The component can connect with everything already there, making complexity rise quadratically rather than one part at a time.

E1

Count the connections, not the parts

A system with a handful of components has a larger set of possible pairwise interactions: dependencies, conflicts, handoffs, and failure paths. Each addition enlarges that interaction surface. This is why subtraction has disproportionate power: removing a component also removes the connections that depended on it, shrinking the space in which failures can emerge.

E1

Quadratic growth is conditional

The model applies when components can meaningfully interact. If parts are isolated or their interfaces are tightly constrained, adding one need not create relationships with everything else; counting every theoretical pair would exaggerate the real complexity.

Delete an interaction hub

Before adding another component, map which existing parts it must communicate with. If the map becomes dense, remove or isolate the component responsible for the most connections instead of simplifying each connection separately.

Episodes that teach this