News for hackers. Stuff that matters.
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.
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.