|
Not Ranked
:
+0 / -0
0 score
Re: Halting Undecidability proof faulty?
hmm, not entirely sure i agree pyrotex, alan turing is assuming that the halting machine is capable of running on itself as input, though a slightly altered version of itself, then goes on to prove that this leads to a contradiction. that is, can't you can't construct a halting machine capable of accepting altered halt, which is a ligament algorithm.
|
