profile-img
Eduncle posted an MCQ
February 22, 2020 • 15:14 pm 0 points
  • UGC NET
  • Computer Science & Applications

Consider the following statements : 

Choose Your Answer:
0 Attempts Submit Now
  • 0 Likes
  • 1 Comments
  • 0 Shares
  • comment-profile-img>
    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.

whatsapp-btn

Do You Want Better RANK in Your Exam?

Start Your Preparations with Eduncle’s FREE Study Material

  • Updated Syllabus, Paper Pattern & Full Exam Details
  • Sample Theory of Most Important Topic
  • Model Test Paper with Detailed Solutions
  • Last 5 Years Question Papers & Answers