in Theory of Computation
268 views
0 votes
0 votes
Consider the following equation:

 

L1:{TM IT M accepts Є}

 

L2:{TM IT M accepts only Є}

 

Which of the following is not semidecidable?

 

SELECT ONE OPTION

 

A L1 only

B L2 only

C Both L1 and L2

D none of the above
in Theory of Computation
268 views

1 comment

I think answer should be l2 only.Since it only becomes rel and thus semidecidable.
0
0

Please log in or register to answer this question.

Related questions