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-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 109fba,f7a7163813ae8672 X-Google-Attributes: gid109fba,public X-Google-Thread: 103376,f7a7163813ae8672 X-Google-Attributes: gid103376,public X-Google-Thread: 10a146,f7a7163813ae8672 X-Google-Attributes: gid10a146,public X-Google-Thread: fa0ae,f7a7163813ae8672 X-Google-Attributes: gidfa0ae,public X-Google-ArrivalTime: 2001-12-18 11:48:25 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!news-spur1.maxwell.syr.edu!news.maxwell.syr.edu!fu-berlin.de!cs.tu-berlin.de!uni-duisburg.de!not-for-mail From: Georg Bauhaus Newsgroups: comp.lang.c++,comp.lang.java.programmer,comp.lang.ada,comp.lang.perl.misc Subject: Re: Best language for low IQ programmers? Date: Tue, 18 Dec 2001 19:48:24 +0000 (UTC) Organization: GMUGHDU Message-ID: <9vo6i8$2r3$1@a1-hrz.uni-duisburg.de> References: <1004990076967295@aol.com> <3be6fcf8$1@news.sentex.net> <9vdb7r$5jf$01$1@news.t-online.com> <9vnh7i$e4$2@a1-hrz.uni-duisburg.de> <3C1F51DB.3DD6EC19@fujitsu-siemens.com> NNTP-Posting-Host: l1-hrz.uni-duisburg.de X-Trace: a1-hrz.uni-duisburg.de 1008704904 2915 134.91.4.34 (18 Dec 2001 19:48:24 GMT) X-Complaints-To: usenet@news.uni-duisburg.de NNTP-Posting-Date: Tue, 18 Dec 2001 19:48:24 +0000 (UTC) User-Agent: tin/1.5.8-20010221 ("Blue Water") (UNIX) (HP-UX/B.11.00 (9000/800)) Xref: archiver1.google.com comp.lang.c++:112435 comp.lang.java.programmer:118348 comp.lang.ada:18064 comp.lang.perl.misc:83124 Date: 2001-12-18T19:48:24+00:00 List-Id: In comp.lang.ada Josef M?llers wrote: : IIRC the abovementioned statement is some well-known theorem of : theoretical computer science (Church's thesis). Yes, but is the finding of the thesis computable by a Turing machine? Or is the thesis computable? (O.K., enough junk) Georg