On Turing machines knowing their own Gödel-sentences (Q2765286)

In the paper under review, the paper ``Can a Turing machine know that the Gödel sentence is true?'' [J. Philos. 96, 525-532 (1999)] by \textit{S. McCall} is discussed. In the latter, McCall argued that human minds transcend Turing machines. In his argumentation a particular true but unprovable sentence of arithmetic and the fact of its irrefutability were used. In the present paper it is shown that metamathematical oversights in McCall's discussion render his philosophical argument for the transcendentalist conclusion invalid.