[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [Scheme-reports] Strong win later reversed: Real numbers have imaginary part #e0
Alex Shinn <alexshinn@x> writes:
> On Sat, Dec 22, 2012 at 2:58 PM, Mark H Weaver <mhw@x> wrote:
> Alex Shinn <alexshinn@x> writes:
> > Exact arithmetic can run out of memory.
> So can your proposed inexacts. In order to avoid underflow and
> overflow, the number of representable values cannot be finite,
> there can be no maximum or minimum representable magnitude.
> the amount of memory needed to represent your numbers is
> unbounded. No
> matter how clever your compression method is, that fact is
> It's not a compression technique, and the amount of
> memory is in practice bounded by the limitations of
What external representation will you use for these numbers? For
example, even if you can efficiently handle something like this:
(do ((i 10000000 (- i 1))
(x 1e300 (expt x x)))
((zero? i) (/ x)))
What will you do if someone applies 'number->string' to the result?
Scheme-reports mailing list