in Theory of Computation
819 views
2 votes
2 votes

Please check if the given answer is correct or not.

in Theory of Computation
819 views

1 Answer

4 votes
4 votes
Best answer
2 can be TRUE. Both can be recursive as recursive set is a proper subset of r.e. set. But 1 can never be TRUE. So, given answer is correct. But does the "polynomial" word in question carry any significance?
selected by
by

1 comment

@Arjun Sir,

How 2nd can be true ?

say L2( RE )is reducible to L1(REC)  

Then this doesn't hold true. 

0
0

Related questions