For reasonable numberings of Turing machines, the halting problem is NP-hard. For unreasonable numberings, it might not be.
-
-
no, I was just jokingly proposing to number TMs by the number of steps in their execution (+arbitrary inside that class),
-
that way all halting TMs are numbered with naturals, and all unhalting - with higher ordinals, solving the halting problem
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.