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 autolearn=ham autolearn_force=no version=3.4.4 X-Google-Thread: 103376,21960280f1d61e84 X-Google-Attributes: gid103376,public X-Google-Language: ENGLISH,ASCII-7-bit Path: g2news2.google.com!news4.google.com!newsfeed2.dallas1.level3.net!news.level3.com!newsfeed-00.mathworks.com!nntp.TheWorld.com!not-for-mail From: Robert A Duff Newsgroups: comp.lang.ada Subject: Re: How come Ada isn't more popular? Date: Sun, 04 Feb 2007 19:39:45 -0500 Organization: The World Public Access UNIX, Brookline, MA Message-ID: References: <1169531612.200010.153120@38g2000cwa.googlegroups.com> <1mahvxskejxe1$.tx7bjdqyo2oj$.dlg@40tude.net> <2tfy9vgph3.fsf@hod.lan.m-e-leypold.de> <1g7m33bys8v4p.6p9cpsh3k031$.dlg@40tude.net> <14hm72xd3b0bq$.axktv523vay8$.dlg@40tude.net> <4zwt33xm4b.fsf@hod.lan.m-e-leypold.de> <1j7neot6h1udi$.14vp2aos6z9l8.dlg@40tude.net> <1170347180.14376.104.camel@localhost.localdomain> NNTP-Posting-Host: shell01.theworld.com Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii X-Trace: pcls4.std.com 1170635986 16545 192.74.137.71 (5 Feb 2007 00:39:46 GMT) X-Complaints-To: abuse@TheWorld.com NNTP-Posting-Date: Mon, 5 Feb 2007 00:39:46 +0000 (UTC) User-Agent: Gnus/5.1008 (Gnus v5.10.8) Emacs/21.3 (irix) Cancel-Lock: sha1:Rbyt4ldYqx8N6uaFXD9ESifbfss= Xref: g2news2.google.com comp.lang.ada:8946 Date: 2007-02-04T19:39:45-05:00 List-Id: Markus E Leypold writes: > ...As I wrote elsewhere: All common programming languages are Turing > complet, OK. >... so equivalent. Equivalent in some sense. >... There is nothing that can be done in one that > could not be done in the other -- in principle. No, I won't agree with the "nothing in one than the other" idea. For example, you can read the clock in standard Ada, but you cannot in standard Pascal. That's "something that can be done" in one language but not the other. Another example: one cannot write the garbage collector of a Java implementation in Java. I'm sure you know this -- I'm just quibbling with your wording: things that can/cannot be done, versus functions that can/cannot be computed (by Turing machines). - Bob