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=-0.4 required=5.0 tests=AC_FROM_MANY_DOTS,BAYES_00 autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,69bb03cc695b330a X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2001-03-09 15:38:06 PST Path: supernews.google.com!sn-xit-03!supernews.com!freenix!isdnet!psinet-france!psiuk-f4!psiuk-p4!uknet!psiuk-n!news.pace.co.uk!nh.pace.co.uk!not-for-mail From: "Marin David Condic" Newsgroups: comp.lang.ada Subject: Re: Large numbers (or is Ada the choice for me?) Date: Fri, 9 Mar 2001 18:28:43 -0500 Organization: Posted on a server owned by Pace Micro Technology plc Message-ID: <98bp0c$nsq$1@nh.pace.co.uk> References: <98bbbg$jmf$1@nh.pace.co.uk> NNTP-Posting-Host: 136.170.200.133 X-Trace: nh.pace.co.uk 984180556 24474 136.170.200.133 (9 Mar 2001 23:29:16 GMT) X-Complaints-To: newsmaster@pace.co.uk NNTP-Posting-Date: 9 Mar 2001 23:29:16 GMT X-Priority: 3 X-MSMail-Priority: Normal X-Newsreader: Microsoft Outlook Express 5.50.4522.1200 X-MimeOLE: Produced By Microsoft MimeOLE V5.50.4522.1200 Xref: supernews.google.com comp.lang.ada:5592 Date: 2001-03-09T23:29:16+00:00 List-Id: "Robert A Duff" wrote in message news:wcck85yeeat.fsf@world.std.com... > "Marin David Condic" writes: > > > This is a hopeless mission. Consider the instant you're row reduction > > results in 1/3 - can you put that into a computer *without* an approximation > > and still do math on it? > > Yes. What's the problem? A rational arithmetic package can do exact > arithmetic on 1/3 or any other rational number you can name. > Well, let me check a few assumptions. 1) We can never run out of numbers. (Go ahead. Use all you want. We'll make more! :-) 2) We *can* and *will* eventually run out of memory. Hence, even if you did all the math with some sort of fractional representation rather than a decimal representation, it would be possible to construct numbers that exceed the capacity of the machine. Hence, I think it stands to reason that you would be off on a fool's errand to insist on no approximations or limitations whatsoever. There has to be some sort of practical upper limit imposed by the available memory if nothing else. As I said elsewhere, I rather hastily picked a bad example - but I think the point still stands that one will have to live with some sort of approximation on the representation - even if in practice, it may be so small as to not matter. (Until you intersect Chaos Theory, at least! :-) MDC