Pinned
I am developing a formal theorem I call the Verification Complexity Barrier.
In a nutshell, if a program has some components `n` that have connectivity factor of `k > 0` , then verification complexity increases superlinearly for each new component. Therefore the time required
