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.4 required=5.0 tests=AC_FROM_MANY_DOTS,BAYES_00
	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 03:13:43 PST
Path: 
 archiver1.google.com!news1.google.com!newsfeed.stanford.edu!bloom-beacon.mit.edu!nycmny1-snh1.gtei.net!nycmny1-snf1.gtei.net!news.gtei.net!colt.net!kibo.news.demon.net!demon!newshub1.nl.home.com!news.nl.home.com!news-x2.support.nl!psinet-eu-nl!psiuk-p4!uknet!psiuk-p3!uknet!psiuk-n!news.pace.co.uk!nh.pace.co.uk!not-for-mail
From: "Marin David Condic" <dont.bother.mcondic.auntie.spam@[acm.org>
Newsgroups: comp.lang.ada
Subject: Re: Generation of permutations
Date: Mon, 6 May 2002 13:26:30 -0400
Organization: Posted on a server owned by Pace Micro Technology plc
Message-ID: <ab6ec7$3uh$1@nh.pace.co.uk>
References: <aajce7$7jb$1@snipp.uninett.no>
 <4519e058.0204300552.15317df9@posting.google.com>
 <aam989$99c$1@nh.pace.co.uk>
 <4519e058.0205020747.11336b44@posting.google.com>
 <3CD1664A.804F56BC@attbi.com> <aau1t7$kq6$1@nh.pace.co.uk>
 <5ee5b646.0205041652.63032ba6@posting.google.com>
NNTP-Posting-Host: dhcp-200-133.miami.pace.co.uk
X-Trace: nh.pace.co.uk 1020705991 4049 136.170.200.133 (6 May 2002 17:26:31
 GMT)
X-Complaints-To: newsmaster@news.cam.pace.co.uk
NNTP-Posting-Date: 6 May 2002 17:26:31 GMT
X-Priority: 3
X-MSMail-Priority: Normal
X-Newsreader: Microsoft Outlook Express 5.50.4522.1200
X-MimeOLE: Produced By Microsoft MimeOLE V5.50.4522.1200
Xref: archiver1.google.com comp.lang.ada:23622
Date: 2002-05-06T17:26:31+00:00
List-Id: <comp.lang.ada>

If you re-read my post, you'll notice that I did indicate you can't use it
because you can't determine that it will ever finish. Its an interesting
concept, but unusable as a sorting algorithm. It was a variation on an old
embedded development strategy: Write a random code generator, then go into
the lab and make patches until it works.

MDC
--
Marin David Condic
Senior Software Engineer
Pace Micro Technology Americas    www.pacemicro.com
Enabling the digital revolution
e-Mail:    marin.condic@pacemicro.com


"Robert Dewar" <dewar@gnat.com> wrote in message
news:5ee5b646.0205041652.63032ba6@posting.google.com...
>
> You could see if it sorted some particular list, but to
> determine whether a set of instructions constitutes a
> general sorting algorithm is obviously recursively
> undecidable. So this is not a well formed method.
>