On Aug 7, 2005, at 10:34 PM, Bradley Lucier wrote:

>
> On Aug 7, 2005, at 12:21 PM, Aubrey Jaffer wrote:
>
>> There is a third way: report a violation of an implementation
>> restriction when trying to return numbers with more than, say, 16000
>> bits.  Practical calculation on numbers larger than that would need
>> FFT multiplication and other number-theoretic algorithms, which is a
>> lot of hair to support execution of simple programming errors.
>
> If you're saying that any computations that need more than 16,000
> bits, then I'd point you to computational number theorists and others
> who use much bigger numbers.  It would be good if these problems could
> be done practically in Scheme.

Sorry, that should be "that any computations that need more than 16,000
bits are simple programming errors, ..."

Brad