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.3 required=5.0 tests=BAYES_00,
	REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4
X-Google-Thread: 103376,9dc2c03e552da989
X-Google-NewGroupId: yes
X-Google-Attributes: gida07f3367d7,domainid0,public,usenet
X-Google-Language: ENGLISH,ASCII
Received: by 10.68.196.232 with SMTP id ip8mr23437054pbc.6.1340217706301;
        Wed, 20 Jun 2012 11:41:46 -0700 (PDT)
X-FeedAbuse: http://nntpfeed.proxad.net/abuse.pl feeded by 78.192.181.72
Path: 
 l9ni73287pbj.0!nntp.google.com!news2.google.com!news4.google.com!feeder1-2.proxad.net!proxad.net!feeder2-2.proxad.net!nntpfeed.proxad.net!78.192.181.72.MISMATCH!gegeweb.42!gegeweb.eu!usenet.pasdenom.info!aioe.org!.POSTED!not-for-mail
From: "Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>
Newsgroups: comp.lang.ada
Subject: Re: Why Ada isn't as successful as it should be
Date: Wed, 20 Jun 2012 20:41:41 +0200
Organization: cbb software GmbH
Message-ID: <1j581cgya2yf4$.1ljofookuk1q0$.dlg@40tude.net>
References: <de7b6a71-0447-4e3f-9000-da6691511796@googlegroups.com>
 <6ca01b24-9733-4698-9c2b-eb2465f4131c@googlegroups.com>
 <op.wf7qeadqule2fv@douda-yannick>
Reply-To: mailbox@dmitry-kazakov.de
NNTP-Posting-Host: 4RFYTQ6jM/dAKFJoI0fUkg.user.speranza.aioe.org
Mime-Version: 1.0
X-Complaints-To: abuse@aioe.org
User-Agent: 40tude_Dialog/2.0.15.1
X-Notice: Filtered by postfilter v. 0.8.2
Content-Type: text/plain; charset="iso-8859-1"
Content-Transfer-Encoding: 8bit
Date: 2012-06-20T20:41:41+02:00
List-Id: <comp.lang.ada>

On Wed, 20 Jun 2012 19:48:00 +0200, Yannick Duch�ne (Hibou57) wrote:

> Le Wed, 20 Jun 2012 16:15:49 +0200, <leonid.dulman@gmail.com> a �crit:
> 
>> On Monday, June 18, 2012 8:12:20 PM UTC+2, Adam Beneschan wrote:
>>> Maybe it isn't about the syntax, the verbosity, or the lack of  
>>> text-handling support:
>>>
>>> http://www.wired.com/wiredenterprise/2012/06/beard-gallery/
>>>
>> There is no any problem to write good game on ADA-2012 or build own WEB  
>> Browser.
>> All you can do on Java, C++, C#, you can do on ADA
> 
> Yes, what can be done with Turing Complete X can also be done with  
> whatever Turing Complete Y, and luckily, Ada is as much Turing Complete as  
> the aboves (teasing :D ).

Wrong.

The correct statement is: any problem which can be solved by a Turing
complete system can be done in either X or Y if both are Turing-complete.

That does not imply that any problem solvable in X is solvable in Y. Only
Turing-complete one are. X can be more than Turing-complete. E.g. real-time
clock, user input, etc available to X but not to Y.

P.S. Turing had no beard. Get lost! (:-))

-- 
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de