User blog comment:B1mb0w/Strong D Function Calculations/@comment-1605058-20150701125933/@comment-10262436-20150701132915

That is not what I am showing.

I think I have proved the Strong D function is quite strong. The strength comes from the results but a very very short explanation is that D(l,m,n) = D(..., D(l,m,n-1), ...) the second parameter is very big and it feeds into the "index" of the next function.

Compare f_m(n) for example. This becomes f_m-1(n) with n nested functions. But the D equivalent above would be D(l,m,n-1) nested functions.

Does this help explain my point ?