2009/9/29 Brian Mastenbrook <[email protected]>: > On Sep 28, 2009, at 5:16 PM, David Rush wrote: > >> Please no. It is far simpler to just provide the O(1) limiting size. >> If inexacts are good enough for overflow they're good enough for the >> entire computation. > > It's a mistake to assume that operations on fixnums are O(1). Your processor > might actually take longer for a 32-bit multiply than it does for an > addition, increment, compare, or any other operation. It might multiply > 8-bit numbers faster than 32-bit numbers.
Perhaps, in the interest of brevity, I was using a different unit for my O(1). These facts you mention have been clearly known since _The Art of Computer Programming_ was published, lo the many moons ago. david rush -- GPG Public key at http://cyber-rush.org/drr/gpg-public-key.txt _______________________________________________ r6rs-discuss mailing list [email protected] http://lists.r6rs.org/cgi-bin/mailman/listinfo/r6rs-discuss
