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 X-Google-Thread: 109fba,f7a7163813ae8672 X-Google-Attributes: gid109fba,public X-Google-Thread: fa0ae,f7a7163813ae8672 X-Google-Attributes: gidfa0ae,public X-Google-Thread: 10a146,f7a7163813ae8672 X-Google-Attributes: gid10a146,public X-Google-Thread: 103376,f7a7163813ae8672 X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2001-12-18 06:25:41 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!news.tele.dk!small.news.tele.dk!194.42.224.136!diablo.netcom.net.uk!netcom.net.uk!btnet-peer!btnet!lnewspeer01.lnd.ops.eu.uu.net!emea.uu.net!newsfeed.siemens.de!news.pdb.sbs.de!not-for-mail From: Josef =?iso-8859-1?Q?M=F6llers?= 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 15:25:31 +0100 Organization: Changes ever so often! Message-ID: <3C1F51DB.3DD6EC19@fujitsu-siemens.com> 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> NNTP-Posting-Host: 172.25.187.68 Mime-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Content-Transfer-Encoding: quoted-printable X-Trace: dackel.pdb.sbs.de 1008685530 23914 172.25.187.68 (18 Dec 2001 14:25:30 GMT) X-Complaints-To: abuse@siemens.de NNTP-Posting-Date: Tue, 18 Dec 2001 14:25:30 +0000 (UTC) X-Mailer: Mozilla 4.77 [en] (X11; U; Linux 2.4.4-4GB i686) X-Accept-Language: en Xref: archiver1.google.com comp.lang.c++:112327 comp.lang.java.programmer:118247 comp.lang.ada:18050 comp.lang.perl.misc:83062 Date: 2001-12-18T15:25:31+01:00 List-Id: Georg Bauhaus wrote: > = > In comp.lang.ada Christian Menke wrote: > : > : If a human brain can cope with it, it must be possible to write a com= piler > : capable of doing it too. > = > Hm, out of curiousity, wouldn't that imply it will be possible to > write a compiler that not only handles Turing machines' input, > but also understands the Making Of the Turing machines' invention? > Could someone ask in the equivalence class of God, please? IIRC the abovementioned statement is some well-known theorem of theoretical computer science (Church's thesis). -- = Josef M=F6llers (Pinguinpfleger bei FSC) If failure had no penalty success would not be a prize -- T. Pratchett