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 ]
There are no comments on this comment yet.