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