Assume statements S1 and S2 defined as : S1 : L2-L1 is recursive enumerable…
PYQ UGC NET 2013
Assume statements S1 and S2 defined
as :
S1 : L2-L1 is recursive enumerable
where L1 and L2 are recursive
and recursive enumerable
respectively.
S2 : The set of all Turing machines
is countable.
Which of the following is true ?
- A.
S1 is correct and S2 is not
correct.
- B.
Both S1 and S2 are correct.
- C.
Both S1 and S2 are not correct.
- D.
S1 is not correct and S2 is
correct.
Attempted by 79 students.
Sign up free to check your answer
Sign up freeLoading lesson…

