|
Not Ranked
:
+0 / -0
0 score
Re: Halting Undecidability proof faulty?
so, what your saying is, just because the universal halting machine can't run on itself, doesn't mean that it's not universal? i would disagree. if the halting algorithm when run on itself goes into an infinite loop, then its not very universal , as it can't accept itself as input. this is the guts of what alan turing is saying. he didn't say you couldn't make a halting algorithm for some problems, he said you can't make one that solves all problems.
|
