|
|
|
|
|
by Jensson
419 days ago
|
|
Language has nothing that corresponds to a recursive function, so that is a bad example. You can write a sentence that could correspond to a call to a recursive function, but its not the same thing as a recursive function. If recursion was just writing the function 10 times like you did in language then people wouldn't struggle with it. |
|
So in this case, "recursive function" would be "clause" or something like that; I'm no linguist. But clauses can embed clauses which can embed further clauses, etc.
I think your usage of recursive functions is just high-level logic—you're describing an inductive proof. We also frame a lot of our social games as recursive processes. But these are conscious processes that we can evaluate consciously; the recursion in spoken language is largely unconscious and very shallow.