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-07 12:59:04 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!news-spur1.maxwell.syr.edu!news.maxwell.syr.edu!cpk-news-hub1.bbnplanet.com!news.gtei.net!newscon02.news.prodigy.com!newsmst01.news.prodigy.com!prodigy.com!postmaster.news.prodigy.com!newssvr21.news.prodigy.com.POSTED!3bae8248!not-for-mail From: tmoran@acm.org Newsgroups: comp.lang.ada Subject: Re: Generation of permutations References: X-Newsreader: Tom's custom newsreader Message-ID: <7mWB8.6827$0z6.115522658@newssvr21.news.prodigy.com> NNTP-Posting-Host: 64.175.242.61 X-Complaints-To: abuse@prodigy.net X-Trace: newssvr21.news.prodigy.com 1020801539 ST000 64.175.242.61 (Tue, 07 May 2002 15:58:59 EDT) NNTP-Posting-Date: Tue, 07 May 2002 15:58:59 EDT Organization: Prodigy Internet http://www.prodigy.com X-UserInfo1: Q[RGGTSDZRRQBQH]]RKB_UDAZZ\DPCPDLXUNNHPHBATBTSUBYFWEAE[YJLYPIWKHTFCMZKVMB^[Z^DOBRVVMOSPFHNSYXVDIE@X\BUC@GTSX@DL^GKFFHQCCE\G[JJBMYDYIJCZM@AY]GNGPJD]YNNW\GSX^GSCKHA[]@CCB\[@LATPD\L@J\\PF]VR[QPJN Date: Tue, 07 May 2002 19:58:59 GMT Xref: archiver1.google.com comp.lang.ada:23671 Date: 2002-05-07T19:58:59+00:00 List-Id: > > So "recursively undecidable" is a fancy way of saying it may get stuck > > in an infinite loop, > > It is more significant than that. If someone says "I'll write a program to do such and such", how should he act differently if told: a) that's recursively undecidable or b) your program may get stuck in an infinite loop