Say team 1 is studying the recursive characteristics of a function.
Team 2 is studying the recurrent characteristics of the same function.
Are the 2 teams studying the same thing?
I have found for recursiveness:
For a sequence $a1, a2, a3, . . . , an, . . .$ a recursive formula is a formula that requires the computation of all previous terms in order to find the value of an ."
"Recurrence relation definition
A recurrence relation is an equation that defines a sequence based on a rule that gives the next term as a function of the previous term(s)."
In case you are wondering why I am asking: I am writing an essay on the partition function. Specifically, I'll be writing on its basic recursive/recurrent? (I have seen both terms used) properties.
I would very much appreciate a explanation of any different nuances or associations the terms may hold!
Have a nice day ;)