moshez at math.huji.ac.il
Thu Feb 24 08:06:41 CET 2000
On 23 Feb 2000, Aahz Maruch wrote:
> >> <blink><blink> What do you call this:
<recursive inefficienct version of fibonacci>
> >Um.....the most inefficienct version of fibonacci I've ever seen?
> Well, sure, but it meets your definition of functional programming. You
> claimed that functional programming is impossible in Python; I've
> provided a counter-example. Do you now retract your claim?
Assuming we're still in "search of truth" mode, rather then "proving I'm
right" mode, I want to clarify my claim: *efficienct* functional
programming is, in general, impossible without tail-recursion. I don't
agree with the timbot that tail-recursion is contrary to the "Python Way",
but it's not in Python right now, anyway.
Are we in agreement now?
Moshe Zadka <mzadka at geocities.com>.
INTERNET: Learn what you know.
Share what you don't.
More information about the Python-list