User blog comment:Wythagoras/All my stuff/@comment-10429372-20130715145943/@comment-5150073-20130715160131

But the function that constructed as follows definitily does:

Let En = I(n), all rules are the same as in Cascading-E notation. Then f(n) = En#^#^#...#^#^#n (with n #'s), will grows faster. This is because time variable just makes one recursion loop after I(n).