From: Andrew Clough (aclough@mit.edu)
Date: Thu Jan 17 2002 - 12:41:39 MST
I have a question about Penrose's Arguments regarding the Turing Halting
Theorem. I see that the program T sub n of n can never successfully prove
that it will never halt, when, in fact, a human can see and prove that it
will never halt. However, I fail to see how the humans task is the same as
the computer's task. If the analogous task, a human asked to create a
proof(n) that they could not create the proof(n), were attempted, the human
would fail just as completely as the program. Of course, a human would
give up after a while, as I'd expect an AI to terminate that subroutine.
This archive was generated by hypermail 2.1.5 : Fri Nov 01 2002 - 13:37:35 MST