Time management is very much important in IIT JAM. The eduncle test series for IIT JAM Mathematical Statistics helped me a lot in this portion. I am very thankful to the test series I bought from eduncle.
Nilanjan Bhowmick AIR 3, CSIR NET (Earth Science)
Eduncle Best Answer
Statement S1 is correct because membership problem of Turing Machines is undecidable.
Statement S2 is correct because subset problem of recursively enumerable languages is undecidable.