Turing's proof, although it seems to use the " diagonal process ", in fact shows that his machine ( called H ) cannot calculate its own number, let alone the entire diagonal number ( Cantor's diagonal argument ) : " The fallacy in the argument lies in the assumption that B [ the diagonal number ] is computable " ( " Undecidable ", p . 132 ).
मोबाइल