Hello John, (01)
On Fri, Nov 16, 2012 at 11:11:32PM -0500, John F Sowa wrote:
> But every major programming language since 1945 has been undecidable,
> and no programmer would ever want less expressive power. (02)
What do you mean with "undecidable" ? That the halting problem is undecidable ?
A decideable programming language would not be Turing complete and IMO should
not be called a programming language. Are regular expressions a programming
language ? Only in a very broad sense. (03)
But that programming languages should be undecideable does not automatically
mean that logics should be undecideable. Don't you compare apples and oranges
here ? A decidable logic should be more useful than a decideable programming
language. (04)
Regards, (05)
Michael Brunnbauer (06)
--
++ Michael Brunnbauer
++ netEstate GmbH
++ Geisenhausener Straße 11a
++ 81379 München
++ Tel +49 89 32 19 77 80
++ Fax +49 89 32 19 77 89
++ E-Mail brunni@xxxxxxxxxxxx
++ http://www.netestate.de/
++
++ Sitz: München, HRB Nr.142452 (Handelsregister B München)
++ USt-IdNr. DE221033342
++ Geschäftsführer: Michael Brunnbauer, Franz Brunnbauer
++ Prokurist: Dipl. Kfm. (Univ.) Markus Hendel (07)
_________________________________________________________________
Message Archives: http://ontolog.cim3.net/forum/ontolog-forum/
Config Subscr: http://ontolog.cim3.net/mailman/listinfo/ontolog-forum/
Unsubscribe: mailto:ontolog-forum-leave@xxxxxxxxxxxxxxxx
Shared Files: http://ontolog.cim3.net/file/
Community Wiki: http://ontolog.cim3.net/wiki/
To join: http://ontolog.cim3.net/cgi-bin/wiki.pl?WikiHomePage#nid1J (08)
|