Many constraints, including those in CSP-style problems, are NP-hard to enforce and therefore cannot be straightforwardly enforced in a static architecture from a computational-complexity perspective.

“Explicitly, there are plenty of constraints which are N_P_ hard to enforce. I get say with a C_S_P_ style problem, this is N_P_ hard to enforce. How are you going to do that in a static architecture? Uh like mathematically it already it it breaks from a complexity point of view. Of course you can then do things like effectively uh do things like a diffusion-esque thing or like a uh a a Monte-Carlo-esque thing, but”