25 Mar
2005
25 Mar
'05
3:18 p.m.
From: "Fred Cisin" <cisin at
xenosoft.com>
Hi
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?
Dwight
"Nobody programs in assembly language
anymore, nor ever will
again." - Clancy and Harvey (UC Berkeley)
On Fri, 25 Mar 2005, Paul Koning wrote:
Wrong, and wrong. Where did they get that
bizarre notion?
The biggest reason why I don't think that I should retire yet -
I teach an assembly language class.
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.
--
Grumpy Ol' Fred cisin at xenosoft.com
25 Mar
25 Mar
3:31 p.m.
At 05:18 PM 3/25/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 Turing test?
Turing test? The one where he wants to sort the men from the women?
- John
4:18 p.m.
[Clancy and Harvey]
On Fri, 25 Mar 2005, David
Betz wrote:
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.
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
7211
days inactive
7212
days old
2 comments
3 participants
participants (3)
-
cisin＠xenosoft.com -
dwight.elvey＠amd.com -
jfoust＠threedee.com