I watched videos and read about it but I still don’t understand why is important and proof of it. Can you please explain me what it is?
Thanks
In: 60
There are several good descriptions of the proof’s of the Halting Problem.
The IMPORTANCE of the halting problem is that it is basically the Computer Science Version Of [Math] Goedel’s Incompleteness theorem.
It is a proof that there are things that are not compute-able. They ARE one way or another, but they cant be computed.
It says, “there are things which can’t be solved”. Not “which are hard to solve” but “with all the computing power that is, and ever will be, for all the time in the universe, cannot be solved”. Which is kinda neat.
Latest Answers