User blog comment:KthulhuHimself/What makes an array notation?/@comment-34422464-20190119011629

People tend to like using recursion rather than making the base operation something with a high growth rate when it’s unnecessary. I’d like to call the recursion level, well recursion level. You calculate it by taking the growth rate of the function and subtracting it by the growth rate of base function (if it is a limit ordinal, do not do anything.)