User blog comment:B1mb0w/Strong D Function/@comment-1605058-20150702183610/@comment-10262436-20150808061258

Hi. I have a question for you on how to interpret the statements at the top of page 23 (pg 15 of original document).

"f(x,0,...,0) = g(x)"

and

"Here A is a term built up from the variables ..., previously given functions"

Do g(x) and "previously given functions" need to be based on primitive operations and maybe simple recursion (For Loops) only ?

If the answer is No. Then it seems to be a very broad definition of all possible functions. Is this correct ?

If the answer is Yes. This section is not relevant to the Strong D Function. There is no way to represent formulas such as D(5,0) or D(1,0,1) using primitive operations and simple recursion.

Appreciate your help.