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,ca0b11ae1c9a00cb X-Google-Attributes: gid103376,public From: Jonas Nygren Subject: Re: Papers saying Ada as an overly complex language and hard to implement Date: 1998/02/24 Message-ID: <34F28B28.6C70707@ehpt.com>#1/1 X-Deja-AN: 328109430 Content-Transfer-Encoding: 7bit References: <34E7B551.115C289F@cs.utexas.edu> <34E8AA02.7ED447E0@cs.utexas.edu> <34E91572.CE9CEED2@cs.utexas.edu> <34EB634F.2EDF9B80@cs.utexas.edu> <6cftm9$1p9@saturn.brighton.ac.uk> <01bd3fc8$13722a20$0f02000a@luisespi> <6cqqon$p97$1@plug.news.pipex.net> X-Priority: 3 (Normal) Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Organization: EHPT Newsgroups: comp.lang.ada Date: 1998-02-24T00:00:00+00:00 List-Id: Nick Roberts wrote: > > Furthermore, as a result of his search, he designed an entire new > programming language which solved all the problems cited in the papers. > Unfortunately, he died, and all that was found was a cryptic comment in the > margin of his notebook saying "I have a wonderful solution for this" ;-) I read in the news that one guy had been rewarded for coming up with a proof for Fermat's theorem. He claimed that only the 100 top mathematicians in the world would be capable of understanding his proof. /jonas PS Nick, I believe it was an English guy DS > > >Luis said > > > >< >Last Theorem; > >he claimed that he had the solution for the problem, yet never published. > >Did he really had it? > >Do these four papers exists at all? > > > >Luis Espinal.