The uncomputability of Σ(n) may be proved in a similar way. In the above proof, one must exchange the machine EvalS with EvalΣ and Clean with Increment — a simple TM, searching for a first 0 on the tape and replacing it with 1.
The uncomputability of Σ(n) may be proved in a similar wa,y. In the above proof, one must exchange the machine EvalS with EvalΣ and Clean with Increment — a simple TM searching for a first 0 on the tape and replacing it with 1.