Totally OT, but frustrated.....
cisin at xenosoft.com
Fri Mar 25 18:18:53 CST 2005
[Clancy and Harvey]
> >They're LISP (actually "SCHEME") fanatics.
> >They demo'd an example that "can not possibly be solved in ANY way
> >but recursion". While they were keying it in in Scheme, I wrote
> >out a non-recursive solution (with a 2D array) in C, BASIC, FORTRAN,
> >and I got halfway through writing the COBOL form.
On Fri, 25 Mar 2005, David Betz wrote:
> Care to share it with us? It sounds intriguing.
On Fri, 25 Mar 2005, Dwight K. Elvey wrote:
> I don't believe that the Turing test does recursion.
> If that is so, they would have to believe that they just
> proved that it couldn't be calculated on a computer
> with or without recursion. An intersting exception to
> the Turning test?
It's been a bunch of years, and I don't remember the wording
of the problem, other than that I could resolve it into
traversing all locations of a 6 by 6 array.
They also apparently teach their students that recursion
is the only way to calculate factorial, Fibonacci sequence,
prime numbers, subdirectory trees, etc.
"To a man who has a hammer, the whole world looks like a nail."
"To a man with MICROS~1 tools, the whole world looks like a thumb."
Grumpy Ol' Fred cisin at xenosoft.com
More information about the cctech