Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon. Entire thread

Non-computability.

Name: Anonymous 2010-03-04 21:21

According to Roger Penrose, humans can perform non-computable feats, such as dealing with Gödel questions. He uses this as a foundation to claim that the human mind cannot be expressed in terms of classical processes, and as such must be party to the only other (known) game in town: Quantum Mechanics.

Now, I haven't had the patience to sit through all of his arguments yet, though I slowly make progress. My understanding is that a large part of his stance is that an algorithm cannot usefully deal with a Gödel question, or equivalently, with the halting problem, while a human can.

My objection to this is that such problems always demand a certain quality of response when asked of UTMs: failing to respond forever is not acceptable as correct, nor is providing any response other than one that yields a truth when taken in combination with the question. This much is fine, however, when it is time for the human to answer, he is permitted the liberty of rejecting the question on the grounds that it is inherently unanswerable.

Obviously I am interested in artificial intelligence, and also find his assertion to be simply a self-serving one with a contrived philosophical backdrop for foundation. If anyone knows of, or can think of, a more sophisticated argument than the one above (or expose my flaws in my assessment of it) I would like to hear it.

Apologies for bringing up a largely philosophical question, my only excuse is that I cannot trust any other board with the question.

Name: Anonymous 2010-03-05 0:41

Obviously, when applied to itself, the candidate fails and must be rejected.

Wait, wait wait wait, let me make sure I'm following you here.

So by "applied to itself", you mean applying the Halt-detector TM on itself recursively, such that the Halt-detector is now determining whether or not the Halt-detector will halt, correct? And you're then saying that the Halt-detector will determine that the Halt-detector will fail -- does that mean the Halt-detector will be able to correctly determine that it has been made to start an infinite recursion and will therefore end the recursion (or, maybe, never evaluate in the first place)? Or does that mean it will continue to go into a loop because it has been made to do so, even though it should be exiting because it will never halt?



I'm not >>4-san, just an outside observer.

Newer Posts
Don't change these.
Name: Email:
Entire Thread Thread List