Türing’s argument that there can be no machine computing the diagonal on the enumeration of the computable sequences is not a demonstration. As well known, Türing historical article of 1936 is the result of a special endeavor focused around the factuality of a general process for algorithmic computation. As resultant formal model his famous abstract computing machine, soon called Türing machine...
