User blog comment:B1mb0w/Strong D Function Calculations/@comment-1605058-20150806124034/@comment-10262436-20150808060131

Hi LittlePeng9

I have finished a comprehensive and very shortened version of the relevant proofs. Appreciate your thoughts of the "General Proof of Strong D Function Growth Rate" blog.

In the meantime, can I just clarify what we have been discussing. I think there are 3 topics we have touched on. A- my function logic and any technical errors I am making. Appreciate all your callouts on this. B- whether the Strong D Function grows faster than f epsilon_0 C- whether any nested n-fold recursive functions can grow faster than f epsilon_0

Very quickly on B. My calculations that reach f epsilon_0 for n=3,4,5,6,7 should be OK. These are just finite numbers, so my function (or anybody's function) will eventually reach these. I don't think I have claimed that Strong D Function grows faster than f epsilon_0. In fact the calculation D(3^^3,0,0) > f epsilon_0 tends to suggest it doesn't since I still need up arrows to get the job done.

Very quickly on C. I am still trying to read the dissertation you suggested. I have a question for you and will leave it on your original post.

Thanks for all your help. Bimb0w