Ordinal complexity of recursive definitions

AbstractWe classify and compare recursive and iterative definitions of total computable functions according to the complexity of the ordinal structures needed to verify termination. An old theorem of Tait is generalised to show that the cost of transforming recursive programs into while-loops is at most an exponential increase in the length of their termination orderings