News for hackers. Stuff that matters.

A comment on Did Turing prove the undecidability of the halting problem?. Parent comment

Re:Did Turing prove the undecidability of the halting problem? by lou1306 on Tuesday July 02, 2024 @06:06AM (#40855082)
> Yes, by restricting things to a non-Turing Complete subset.

No, not necessarily. There are procedures that _can_ verify properties against Turing-complete and even infinite-state systems. It's just that no _general_ (as in, sound and complete) procedure can exist.

[ Parent | on HN ]
Re:Did Turing prove the undecidability of the halting problem? by tsimionescu on Tuesday July 02, 2024 @08:26AM (#40855950)
If it's not sound, than the result is meaningless. If it is not complete, then it only works on a subset of problems, which is equivalent to what I said.
[ Parent | on HN ]
Re:Did Turing prove the undecidability of the halting problem? by lou1306 on Tuesday July 02, 2024 @10:46AM (#40857225)
Agree that soundness is desirable, but "it only works on a subset of instances" and "you are restricted to a non-Turing complete subset" are not equivalent in the slightest.
[ Parent | on HN ]
Re:Did Turing prove the undecidability of the halting problem? by lostmsu on Tuesday July 02, 2024 @01:20PM (#40858669)
Not sure what are you trying to say. Surely the "subset of instances" is non-Turing complete.
[ Parent | on HN ]