Re: Generation of permutations

[Darren New <dnew@san.rr.com>]

tmoran@acm.org wrote:
>   To me, "reliably" does not imply "always".  It simply implies that
> it never gives a *wrong* answer.

Well, not giving any answer at all is a wrong answer. Otherwise, the
program that consists of 

while (1) {}

will be a very reliable program for every purpose, which is
counterintuitive.

It's also a wrong answer by the nature of the definition of "recursive
undecidability", if you care to talk about formal definitions for
terminology.

In any case, considering that the original message was talking about
"recursive undecidability", a simple google on that phrase would have
revealed exactly what was meant.

And this thread has probably gone on waaaaay too long, so if we're just
going to continue with "I thought" / "you thought" etc, it's not
worthwhile for me to answer. You may have the last word. :-)

-- 
Darren New 
San Diego, CA, USA (PST). Cryptokeys on demand.
   The 90/10 rule of toothpaste: the last 10% of 
         the tube lasts as long as the first 90%.