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.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,8ce0b4db34f42ba9
X-Google-Attributes: gid103376,public
From: eachus@spectre.mitre.org (Robert I. Eachus)
Subject: Re: ada help please
Date: 1999/02/01
Message-ID: <EACHUS.99Feb1173757@spectre.mitre.org>#1/1
X-Deja-AN: 439525821
References: <36ab9c3f.2963059@news.ptd.net>
 <36ad2d46.24886495@news.pacbell.net>
Organization: The Mitre Corp., Bedford, MA.
Newsgroups: comp.lang.ada
Date: 1999-02-01T00:00:00+00:00
List-Id: <comp.lang.ada>

In article <36ad2d46.24886495@news.pacbell.net> tmoran@bix.com (Tom Moran) writes:

 >   The old IBM 1620 did this with an addition table.  ie, make two,
 > two-dimensional arrays (one for "with carry", one without) indexed by
 > the characters '0' .. '9' to give the sum character.  Initialize these
 > constant arrays yourself from any 1st grade arithmetic text.  You'll
 > also need similar arrays of Boolean to tell if you should generate a
 > carry.

   Ah, someone else who remembers the CADET (Can't Add Doesn't Even Try).
Seriously, since the 1620 allowed overwriting of the addition and
multiplication tables, you could change the arithmetic base, but only
to values less than 10.  So a lot of work got done studying base 7
arithmetic.  (The largest prime base possible on the 1620.)  I
expected Ada's support for bases up to 16 to result in a flurry of
papers on base 13.

--

					Robert I. Eachus

with Standard_Disclaimer;
use  Standard_Disclaimer;
function Message (Text: in Clever_Ideas) return Better_Ideas is...