User blog comment:Mh314159/new YIP notation/@comment-39585023-20190709154901/@comment-39585023-20190710002604

Please note that by recursing the leading terms in the definition of n before proceeding to gn(n) and then by recursing the trailing term in  0 0(x) I have greatly increased the recursiveness while still (I believe and hope) terminating. At least, in my simple examples, I have found no calls that generate expressions larger than the one being recursed.