From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00,FREEMAIL_FROM autolearn=ham autolearn_force=no version=3.4.4 X-Google-Thread: 103376,c4cb2c432feebd9d X-Google-Thread: 1094ba,c4cb2c432feebd9d X-Google-Thread: 101deb,15c6ed4b761968e6 X-Google-Attributes: gid103376,gid1094ba,gid101deb,public X-Google-Language: ENGLISH,ASCII-7-bit Path: g2news2.google.com!news2.google.com!news4.google.com!border1.nntp.dca.giganews.com!border2.nntp.dca.giganews.com!nntp.giganews.com!newspeer1.nwr.nac.net!newsfeeds.ihug.co.nz!ihug.co.nz!ken-transit.news.telstra.net!ken-spool.news.telstra.net!ken-in.news.telstra.net!news.telstra.net!news-server.bigpond.net.au!53ab2750!not-for-mail From: "robin" Newsgroups: comp.lang.ada,comp.lang.fortran,comp.lang.pl1 References: <0ugu4e.4i7.ln@hunter.axlog.fr> <%P_cg.155733$eR6.26337@bgtnsc04-news.ops.worldnet.att.net> <6H9dg.10258$S7.9150@news-server.bigpond.net.au> <1hfv5wb.1x4ab1tbdzk7eN%nospam@see.signature> <20060712.7A4E6E0.D028@mojaveg.lsan.sisna <20060714.7A4E988.A30D@mojaveg.lsan.sisna.com> Subject: Re: ONES COMPLEMENT (was: Ada vs Fortran for scientific applications) X-Newsreader: Microsoft Outlook Express 4.72.3110.5 X-MimeOLE: Produced By Microsoft MimeOLE V4.72.3110.3 Message-ID: <_5Xug.6870$tE5.4349@news-server.bigpond.net.au> Date: Tue, 18 Jul 2006 01:48:42 GMT NNTP-Posting-Host: 203.54.177.147 X-Complaints-To: abuse@bigpond.net.au X-Trace: news-server.bigpond.net.au 1153187322 203.54.177.147 (Tue, 18 Jul 2006 11:48:42 EST) NNTP-Posting-Date: Tue, 18 Jul 2006 11:48:42 EST Organization: BigPond Internet Services Xref: g2news2.google.com comp.lang.ada:5749 comp.lang.fortran:12132 comp.lang.pl1:2021 Date: 2006-07-18T01:48:42+00:00 List-Id: glen herrmannsfeldt wrote in message ... >Everett M. Greene wrote: >(snip) > >> Doing multi-precision arithmetic on a ones complement >> machine can be a real challenge. > >Well, you want unsigned arithmetic to do multiple precision, >which is harder if a machine only supplies ones complement. In what way? The arithmetic is done using fewer bits than word. You have to do that with twos complement also. The arithmetic required is addition; and all values manipulated are positive. Results are the same in machines supporting ones or twos complement representation for negative values.