I've been working on this off and on when I get a chance, even before
my first guess. My version of this defines an operation as a
recursive function f(N,m,n), where N is the degree of the operation.
m is one of the operands. n is the other operand, which is the
counting operand. n is the
To be slightly more clear
d(m,n) = f(1,m,f(2,m,f(3,m,f(4,m,...f(n,m,n)...)
Note that the it's only the innermost function that has degree n. To
simplify things, I suppose we could just consider f(n,m,n) by itself.
This has the same property that as n approaches infinity, the degree of
2 matches
Mail list logo
