Re: Why Ada isn't as successful as it should be

["Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>]

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