User blog comment:Boboris02/MBOT/@comment-30167082-20161218151736/@comment-1605058-20161219181022

I was not talking about the process of creating the mentioned function as "strong". I was refering to the function itself being strong. If you wish, you can think of it as an alternative to diagonalization (by which I mean e.g. taking \(\{n,n,\dots,n\}\), \(n\) times \(n\) for linear BEAF), rather than dumbly beating it.