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=-0.3 required=5.0 tests=BAYES_00,FREEMAIL_FROM,
	REPLYTO_WITHOUT_TO_CC autolearn=no 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-05 19:20:12 PST
Path: 
 archiver1.google.com!news1.google.com!newsfeed.stanford.edu!bloom-beacon.mit.edu!howland.erols.net!nntp.abs.net!news.voicenet.com!nntp.upenn.edu!msunews!not-for-mail
From: "Chad R. Meiners" <crmeiners@hotmail.com>
Newsgroups: comp.lang.ada
Subject: Re: Generation of permutations
Date: Sun, 5 May 2002 22:13:45 -0400
Organization: Michigan State University
Message-ID: <ab4ovt$1d51$1@msunews.cl.msu.edu>
References: <5ee5b646.0205041652.63032ba6@posting.google.com>
 <p_iB8.3409$9d1.36389081@newssvr21.news.prodigy.com>
Reply-To: "Chad R. Meiners" <crmeiners@hotmail.com>
NNTP-Posting-Host: arctic.cse.msu.edu
X-Priority: 3
X-MSMail-Priority: Normal
X-Newsreader: Microsoft Outlook Express 6.00.2600.0000
X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2600.0000
Xref: archiver1.google.com comp.lang.ada:23569
Date: 2002-05-05T22:13:45-04:00
List-Id: <comp.lang.ada>

No that is not what Robert was saying.  He was referring to Rice's Theorem
for which you can clearly show that the problem of determining whether a
given set of machine instructions will sort an given input is
Turing-undecidable.  How did you come to such a misinterpretation?

<tmoran@acm.org> wrote in message
news:p_iB8.3409$9d1.36389081@newssvr21.news.prodigy.com...
> > but to determine whether a set of instructions constitutes a general
> > sorting algorithm is obviously recursively undecidable.
>   So the set of instructions emitted by Gnat when it compiles bubble sort
> code may or may not constitute a general sorting algorithm, and whether
> it does or not is undecidable?  I learn something new every day.