0
$\begingroup$

What method(s) can I use in general to proof HALT doesn't reduce to given language?

$\endgroup$
1
$\begingroup$

Mostly, show that $L$ is decidable, mostly by designing an algorithm to decide it.

$\endgroup$
  • $\begingroup$ What if L is not decidable like "Consistent Guessing"? $\endgroup$ – smrt28 Jun 6 '18 at 7:34

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.