“At this point, the cautious reader might wish to read over the whole argument again, as presented above, just to make sure that I have not indulged in any 'sleight of hand'! Admittedly there is an air of the conjuring trick about the argument, but it is perfectly legitimate, and it only gains in strength the more minutely it is examined. We have found a computation Ck(k) that we know does not stop; yet the given computational procedure A is not powerful enough to ascertain that facet. This is the Godel(-Turing) theorem in the form that I require. It applies to any computational procedure A whatever for ascertaining that computations do not stop, so long as we know it to be sound. We deduce that no knowably sound set of computational rules (such as A) can ever suffice for ascertaining that computations do not stop, since there are some non-stopping computations (such as Ck(k)) that must elude these rules. Moreover, since from the knowledge of A and of its soundness, we can actually construct a computation Ck(k) that we can see does not ever stop, we deduce that A cannot be a formalization of the procedures available to mathematicians for ascertaining that computations do not stop, no matter what A is.

Hence:

(G) Human mathematicians are not using a knowably sound algorithm in order to ascertain mathematical truth.

It seems to me that this conclusion is inescapable. However, many people have tried to argue against it-bringing in objections like those summarized in the queries Q1-Q20 of 2.6 and 2.10 below-and certainly many would argue against the stronger deduction that there must be something fundamentally non-computational in our thought processes. The reader may indeed wonder what on earth mathematical reasoning like this, concerning the abstract nature of computations, can have to say about the workings of the human mind. What, after all, does any of this have to do with the issue of conscious awareness? The answer is that the argument indeed says something very significant about the mental quality of understanding-in relation to the general issue of computation-and, as was argued in 1.12, the quality of understanding is something dependent upon conscious awareness. It is true that, for the most part, the foregoing reasoning has been presented as just a piece of mathematics, but there is the essential point that the algorithm A enters the argument at two quite different levels. At the one level, it is being treated as just some algorithm that has certain properties, but at the other, we attempt to regard A as being actually 'the algorithm that we ourselves use' in coming to believe that a computation will not stop. The argument is not simply about computations. It is also about how we use our conscious understanding in order to infer the validity of some mathematical claim-here the non-stopping character of Ck(k). It is the interplay between the two different levels at which the algorithm A is being considered-as a putative instance of conscious activity and as a computation itself-that allows us to arrive at a conclusion expressing a fundamental conflict between such conscious activity and mere computation.”