|[16 earlier articles]|
|Re: Ada GC (was about Java VM) email@example.com (1996-02-02)|
|Re: Ada GC (was about Java VM) root@linux_pc.org (1996-02-03)|
|Re: Ada GC (was about Java VM) firstname.lastname@example.org (1996-02-04)|
|Re: Ada GC (was about Java VM) email@example.com (1996-02-04)|
|Re: Ada GC (was about Java VM) firstname.lastname@example.org (1996-02-04)|
|Re: Ada GC (was about Java VM) email@example.com (1996-02-09)|
|Re: Ada GC (was about Java VM) firstname.lastname@example.org (1996-02-09)|
|Re: Ada GC (was about Java VM) kdm@Rational.COM (1996-02-13)|
|From:||email@example.com (Robert I. Eachus)|
|Date:||9 Feb 1996 14:37:11 -0500|
|Organization:||The Mitre Corp., Bedford, MA.|
|References:||96-01-037 96-02-032 96-02-048|
firstname.lastname@example.org (Steve Witham) writes:
> Funny, that's lot like the old argument against floating point. If
> you don't even know the range and precision you need, then you don't
> understand the system well enough to build it at all!
> Last I heard, Charles Moore, Mr. FORTH, still says this.
I say the same thing.
> Do you use floating point?
After determining the range and precision I need, I see if a
floating point engine can be used. Often I use integer (or some
languages fixed point), or a rational arithmetic package instead.
There are times when the best way to get the right answer is to use
floating point. But if you don't know what arithmetic to use in your
program why did you start coding?
Flame retardant, and a way to make it relevant to all these
groups. ;-) Right now I am looking into a public key authentication
method for Java applets. It looks like the fastest method--for
users--will use either square roots or cube roots modulo the product
of two large primes. Obviously I can prototype using floating point
(as long as I pay attention to what I am doing!) but any production
code will have to use a multiprecision arithmetic package.
Robert I. Eachus
Return to the
Search the comp.compilers archives again.