Re: Efficiency of Y (Was: Limitation with lambda)

[edward@ucbarpa.berkeley.edu (Edward Wang)]

In article <8811142229.AA01756@duchamps.ads.com> you write:
>   3.	Compute the factorial of a number using each of the three procedures,
>	timing the results.  Make the number large enough so that you can get
>	a reasonably accurate timing.  (I found 100 worked well for MacScheme,
>	and 1000 for T on my Sun 3.)
>
>I found performance of the three to be identical, leading me to believe that,
>given current Scheme compiler technology, there's no reason to avoid using Y.

Wouldn't the time be dominated by bignum arithmetic?
A better test would be to go through the iterations without
actually computing the factorial.