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,6609c40f81b32989 X-Google-NewGroupId: yes X-Google-Thread: 1094ba,9bdec20bcc7f3687 X-Google-NewGroupId: yes X-Google-Attributes: gida07f3367d7,gid8d3408f8c3,domainid0,public,usenet X-Google-Language: ENGLISH,ASCII Path: g2news1.google.com!postnews.google.com!q15g2000yqj.googlegroups.com!not-for-mail From: sjw Newsgroups: comp.lang.ada,comp.lang.fortran,comp.lang.pl1 Subject: Re: Why is Ada considered "too specialized" for scientific use Date: Fri, 16 Apr 2010 04:04:55 -0700 (PDT) Organization: http://groups.google.com Message-ID: References: <4bb9c72c$0$6990$9b4e6d93@newsspool4.arcor-online.net> <4bba8bf1$0$56418$c30e37c6@exi-reader.telstra.net> <4bbb2246$8$fuzhry+tra$mr2ice@news.patriot.net> <4bbb5386$0$56422$c30e37c6@exi-reader.telstra.net> <4bbdf5c6$1$fuzhry+tra$mr2ice@news.patriot.net> NNTP-Posting-Host: 20.133.0.13 Mime-Version: 1.0 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: quoted-printable X-Trace: posting.google.com 1271415895 16617 127.0.0.1 (16 Apr 2010 11:04:55 GMT) X-Complaints-To: groups-abuse@google.com NNTP-Posting-Date: Fri, 16 Apr 2010 11:04:55 +0000 (UTC) Complaints-To: groups-abuse@google.com Injection-Info: q15g2000yqj.googlegroups.com; posting-host=20.133.0.13; posting-account=_RXWmAoAAADQS3ojtLFDmTNJCT0N2R4U User-Agent: G2/1.0 X-HTTP-UserAgent: Mozilla/5.0 (Windows; U; Windows NT 5.1; en-GB; rv:1.9.2.3) Gecko/20100401 Firefox/3.6.3,gzip(gfe) Xref: g2news1.google.com comp.lang.ada:10017 comp.lang.fortran:22445 comp.lang.pl1:1149 Date: 2010-04-16T04:04:55-07:00 List-Id: On Apr 8, 4:27=A0pm, Shmuel (Seymour J.) Metz wrote: > In , on 04/07/2010 > =A0 =A0at 08:27 PM, Simon Wright said: > > >Wasn't Ada Augusta's first program an algorithm to compute Fibonacci > >numbers? That would certainly have been in machine code. > > But was it a new algorithm, or merely a transcription of an algorithm tha= t > she already knew? And, more important, do you know for a fact that *Robin= * > knew about it? Note carefully what I asked and what I didn't ask. Sorry, can't be bothered. Especially since this thread was all about algorithms being *implemented* not *developed*.