" Cogito ergo sum non machina!" About Gödel's first incompleteness theorem and turing machines

The aim of this paper is to argue about the impossibility of constructing a complete formal theory or a complete Turing machines’ algorithm that represent the human capacity of recognizing mathematical truths. More specifically, based on a direct argument from Gödel’s First Incompleteness Theorem, we discuss the impossibility of constructing a complete formal theory or a complete Turing machines’ algorithm to the human capacity of recognition of first-order arithmetical truths and so of mathematical truths in general.