I recently learnt about undecidable languages and semi-decidable languages. But I am still quite confused on how I can determine if a language is semi-decidable. Is there any standard theorem or axiom which I can use to find out if a problem is semi-decidable??

Thanks in advance!

  • $\begingroup$ Have you correctly understood what the definition of semi-decidable is? It should be pretty obvious from that how to prove a language satisfies the requirements... $\endgroup$ – dkaeae Dec 20 '18 at 13:25

Your Answer

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

Browse other questions tagged or ask your own question.