Path: utzoo!utgpu!watserv1!watmath!att!occrsh!uokmax!apple!julius.cs.uiuc.edu!zaphod.mps.ohio-state.edu!rpi!leah!bingvaxu!vu0310
From: vu0310@bingvaxu.cc.binghamton.edu (R. Kym Horsell)
Newsgroups: comp.arch
Subject: Re: F.P. vs. arbitrary-precision
Message-ID: <3983@bingvaxu.cc.binghamton.edu>
Date: 11 Sep 90 17:44:52 GMT
References: <3755@osc.COM> <4513@taux01.nsc.com> <119244@linus.mitre.org> <6837.26e7ee92@vax1.tcd.ie> <119612@linus.mitre.org> <3977@bingvaxu.cc.binghamton.edu> <119733@linus.mitre.org>
Reply-To: vu0310@bingvaxu.cc.binghamton.edu.cc.binghamton.edu (R. Kym Horsell)
Organization: SUNY Binghamton, NY
Lines: 12

In article <119733@linus.mitre.org> bs@gauss.UUCP (Robert D. Silverman) writes:
\\\
>This proves how little you know about 'bc'. I have code for the SPARC
>that beats it by almost two orders of magnitude when performing 
>multi-precise multiplication/division. It's _awful_ slow.
\\\

An interesting comment. Although I only do simple-minded stuff, that
would mean your routines can calc the first 1000 factorials in 20 ms --
pretty good! I'd submit those routines to the net!

-Kym Horsell