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: 103376,c42dbf68f5320193 X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2002-05-10 21:05:41 PST Path: archiver1.google.com!postnews1.google.com!not-for-mail From: dewar@gnat.com (Robert Dewar) Newsgroups: comp.lang.ada Subject: Re: Generation of permutations Date: 10 May 2002 21:05:41 -0700 Organization: http://groups.google.com/ Message-ID: <5ee5b646.0205102005.6dd6a4d2@posting.google.com> References: <5ee5b646.0205041652.63032ba6@posting.google.com> <3CDAB578.6F32339D@san.rr.com> <5ee5b646.0205091548.cd99d4c@posting.google.com> NNTP-Posting-Host: 205.232.38.244 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: 8bit X-Trace: posting.google.com 1021089941 7998 127.0.0.1 (11 May 2002 04:05:41 GMT) X-Complaints-To: groups-abuse@google.com NNTP-Posting-Date: 11 May 2002 04:05:41 GMT Xref: archiver1.google.com comp.lang.ada:23882 Date: 2002-05-11T04:05:41+00:00 List-Id: "Chad R. Meiners" wrote in message news:... > You should note that Robert's proof is in essence correct except that he > assumes that the wrong machine exists. I assume nothing of the kind, this is some kind of language problem or other misunderstanding of what I wrote, which was a simple equivalence proof (the is-a-sort predicate is undecidable if the halting-problem is undecidable).