Yah Stephen Wolfram is too often grandiose thereby missing the hard edges.

But in this case, given how hard P=NP is, it might create wiggle room for progress.

Ideally it would have gone on and said in view of lemma/proof/conjecture X, sampling enumerated programs might shine light on ... no doubt that'd be better.

But here I'm inclined to let it slide if it's a new attack vector.