Informal proof
A machine could, in principle, construct an informal proof of the truth of the Gödel sentence. So long as the machine doesn't regard such informal persuasions as proof proper, introducing them into its system won't lead to inconsistency.
So a, self-referential machine may recognise the truth of its own Gödel sentence without using a Gödelizing operator.
Paul Benacerral (1967).