retagged by
413 views
0 votes
0 votes
While applying decidability theorem, can we only apply this theorem to undecidable problems or can we also apply them to recursively enumerable ie semidecidablle problems??
retagged by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
3
aditi19 asked Oct 29, 2018
251 views
A recursive language is empty or a recursive language contains all strings over sigma*. Why this problem is undecidable?