the form (8n)Q(n) where Q(n) is a computable property of the natural number n and refers to such sentences as "statements of the form [Q]". 2 Again Penrose emphasizes that "we can directly apply the Godelian insight to any algorithm that purports to be generating (say [Q]-type) mathematical truths." Thus, for any such algorithm F, Godel's theorem provides us with a corresponding [Q]-type sentence G(F) such that if F is sound (in the sense that all the [Q]-type sentences it generates are true) then G(F) is true although it is not one of the sentences generated by F. Penrose goes on to say: The original algorithm is thus limited in what it is able to achieve: It is unable

this paper please consult me first, via my home page.