On 17/05/2011 23:20, Ian Kelly wrote:
On Tue, May 17, 2011 at 4:26 PM, Xah Lee<xah...@gmail.com> wrote:
Though, if you think about it, it's not exactly a correct description.
“Recursive”, or “recursion”, refers to a particular type of algorithm,
or a implementation using that algorithm.
Only when used as programming jargon. In mathematics, "recursive
function" does *not* mean "a function implemented using a recursive
algorithm". It's just a formal definition of a specific class of
mathematical functions.
As it turns out, "recursive" also has a non-technical definition,
which again has nothing to do with algorithms except in the broadest
sense:
recursive adj.
1. pertaining to or using a rule or procedure that can be applied repeatedly
(from dictionary.com)
This definition fits the Unix usage perfectly.
I concur, although my dictionary defines the base of the word:
"to happen many times or to happen again"
http://dictionary.cambridge.org/dictionary/british/recur#recur__3
Perhaps the gp of the post might profit from a more holistic approach
when adopting an opinion or at least consult a dictionary before going
into a rant.
--
mph
--
http://mail.python.org/mailman/listinfo/python-list
