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-07 10:50:15 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!canoe.uoregon.edu!elk.ncren.net!nntp.upenn.edu!msunews!not-for-mail From: "Chad R. Meiners" Newsgroups: comp.lang.ada Subject: Re: Generation of permutations Date: Tue, 7 May 2002 13:44:49 -0400 Organization: Michigan State University Message-ID: References: <5ee5b646.0205041652.63032ba6@posting.google.com> Reply-To: "Chad R. Meiners" 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:23661 Date: 2002-05-07T13:44:49-04:00 List-Id: wrote in message news:PsLB8.6706$cT1.98522399@newssvr21.news.prodigy.com... > So "recursively undecidable" is a fancy way of saying it may get stuck > in an infinite loop, It is more significant than that. I suggest that instead of shruging off your lack of knowledge in this important topic, you should acquire a book on the subject and read through some of it. I suggest "Introduction to the Theory of Computation" by Michael Sipser.