comp.lang.ada
 help / color / mirror / Atom feed
From: Darren New <dnew@san.rr.com>
Subject: Re: Generation of permutations
Date: Tue, 07 May 2002 00:26:33 GMT
Date: 2002-05-07T00:26:33+00:00	[thread overview]
Message-ID: <3CD71F4D.C29A60FC@san.rr.com> (raw)
In-Reply-To: yUEB8.6035$LT4.79736961@newssvr21.news.prodigy.com

tmoran@acm.org wrote:
> 
> > ... is generally taken to mean ... by folks who ...
>   The First Commandment to a writer is "Know your audience".  Phrases
> with an idiosyncratic meaning to one audience are just confusing when
> directed to different audiences.

The First Commandment to a newsgroup reader is "if you don't understand
it, try google." 

Somehow, tho, I thought that any software engineer would have had at
least one class about computability (or at least formal mathematics) and
would therefore have recognised the form of the statement. If you don't
recognise "a given set of machine instructions" as meaning any arbitrary
set of programs then, well, I guess you haven't studied much formally.

>   Prof to students: "Here is a set of machine instructions in the form of
> Ada source code.  What do they do?  Prove it."
> Poor students: "How the heck should I know?"
> Medium students: "It's a bubble sort, and here's a proof that it works."
> Good students: "How the heck could I know?"

But that's not the question. The question is "write a program that tells
whether the input to that program is another program that will sort the
list." The question isn't "does program X sort the list", but rather
"does program Y reliably tell you that program X sorts a list, for any
program X."

How about this:
Take the output from SHA-1 hashing a counter. Arrange the list in the
order indicated by the result of the hash. Check to see if it's sorted,
and halt if it is. Does that ever sort the list? Good students: "How the
heck could I know?"

The original comment was 
> to determine whether a set of instructions constitutes a
> general sorting algorithm is obviously recursively
> undecidable

If you don't understand that sentence, then why argue with people who
explain it to you? If "recursively undecidable" doesn't mean anything to
you, then arguing that "a given set of instructions" is unintuitive is
foolish. Implicit in the meaning of "recursively undecidable" is the
quantifier in front of "a set of instructions." You asked what you're
missing, and when you're told that, you argue that ... what, you
shouldn't have missed it? Or that the person telling you what you missed
is wrong? Or that since you're more ignorant than the Robert about the
subject, he should educate you before pointing out your mistake? 

-- 
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%.



  reply	other threads:[~2002-05-07  0:26 UTC|newest]

Thread overview: 88+ messages / expand[flat|nested]  mbox.gz  Atom feed  top
2002-04-29 11:54 Generation of permutations Reinert Korsnes
2002-04-30 13:52 ` Ted Dennison
2002-04-30 14:20   ` Marin David Condic
2002-05-02 12:32     ` Robert Dewar
2002-05-02 15:47     ` Ted Dennison
2002-05-02 16:16       ` Mark Biggar
2002-05-03 13:04         ` Marin David Condic
2002-05-05  0:52           ` Robert Dewar
2002-05-05 23:11             ` tmoran
2002-05-06  2:13               ` Chad R. Meiners
2002-05-06 13:52                 ` Stephen Leake
2002-05-09 17:44                   ` Darren New
2002-05-09 18:07                     ` Stephen Leake
2002-05-09 20:58                       ` Darren New
2002-05-09 23:21                         ` tmoran
2002-05-09 23:51                           ` Darren New
2002-05-10  3:37                             ` tmoran
2002-05-10  3:59                               ` Darren New
2002-05-10 13:13                               ` Robert Dewar
2002-05-25 16:21                         ` Robert I. Eachus
2002-05-09 23:24                       ` Robert Dewar
2002-05-09 23:48                       ` Robert Dewar
2002-05-10  3:37                         ` tmoran
2002-05-10 15:10                         ` Chad R. Meiners
2002-05-11  4:04                           ` Robert Dewar
2002-05-16  1:35                             ` Chad R. Meiners
2002-05-11  4:05                           ` Robert Dewar
2002-05-06 15:46                 ` Wes Groleau
2002-05-06 16:21                   ` Chad R. Meiners
2002-05-06 16:33                   ` Darren New
2002-05-07  0:06                     ` tmoran
2002-05-07  0:26                       ` Darren New [this message]
2002-05-07  1:56                         ` tmoran
2002-05-07 10:39                           ` Robert Dewar
2002-05-07 17:25                             ` Chad R. Meiners
2002-05-08  2:27                               ` Robert Dewar
2002-05-08  8:44                               ` Mats Karlssohn
2002-05-07 17:00                         ` Wes Groleau
2002-05-06 21:33               ` Robert Dewar
2002-05-06 17:26             ` Marin David Condic
2002-05-07  7:35             ` tmoran
2002-05-07 13:22               ` Marin David Condic
2002-05-08  5:23                 ` tmoran
2002-05-08 14:10                   ` Marin David Condic
2002-05-09 16:20                     ` Darren New
2002-05-09 19:04                     ` tmoran
2002-05-08 16:20                   ` Darren New
2002-05-08 17:31                     ` tmoran
2002-05-08 17:39                     ` Chad R. Meiners
2002-05-07 15:34               ` Darren New
2002-05-07 17:44               ` Chad R. Meiners
2002-05-07 19:58                 ` tmoran
2002-05-07 21:05                   ` Turing-undecidable languages (OT) Chad R. Meiners
2002-05-08  8:24                     ` Danx
2002-05-08 17:16                       ` Chad R. Meiners
2002-05-10  2:37                       ` Robert Dewar
2002-05-08  9:16                     ` Dmitry A. Kazakov
2002-05-08 17:18                       ` Chad R. Meiners
2002-05-09 20:56                         ` Dmitry A.Kazakov
2002-05-09 16:18                           ` Chad R. Meiners
2002-05-10  2:52                             ` Robert Dewar
2002-05-08  2:17               ` Generation of permutations Robert Dewar
2002-05-03 13:13         ` Ted Dennison
2002-05-03 13:24           ` Lutz Donnerhacke
2002-04-30 15:06   ` Hyman Rosen
2002-05-01  8:40     ` Adrian Hoe
2002-05-01 19:53       ` Hyman Rosen
2002-05-11  1:52     ` Steven Deller
2002-05-02 16:24   ` Mark Biggar
2002-04-30 17:12 ` Wes Groleau
2002-04-30 22:57   ` Robert Dewar
2002-05-01  0:54     ` tmoran
2002-05-01  9:42       ` Florian Weimer
2002-05-02 12:34         ` Robert Dewar
2002-05-01 12:43       ` Robert Dewar
2002-05-01 15:05         ` TO WHOM IT MAY CONCERN Wes Groleau
2002-05-02 12:27           ` More on copyright, (Re: TO WHOM IT MAY CONCERN) Robert Dewar
2002-05-08 13:56             ` Wes Groleau
2002-05-08 18:01               ` Robert Dewar
2002-05-08 18:31                 ` Hyman Rosen
2002-05-09 13:41                 ` Wes Groleau
2002-05-01 12:46       ` Generation of permutations Robert Dewar
2002-05-01 18:22         ` OT:Copyright, was " tmoran
2002-05-01 21:56           ` Robert Dewar
2002-05-01 23:45             ` tmoran
2002-05-02 11:58               ` Robert Dewar
2002-05-01 14:55     ` Wes Groleau
2002-05-02 12:41       ` Robert Dewar
replies disabled

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox