UGC-NET | UGC NET CS 2018 July – II | Question 40
Consider the following statements( ):
S1: There exists no algorithm for deciding if any two Turing machines M 1 and M 2 accept the same language.
S2: The problem of determining whether a Turing machine halts on any input is undecidable.
Which of the following options is correct?
(A) Both S 1 and S2 are correct
(B) Both S1 and S2 are not correct
(C) Only S1 is correct
(D) Only S2is correct
Answer: (A)
Explanation:
There exists no algorithm for deciding if any two Turing machines M 1 and M 2 accept the same language. True
The problem of determining whether a Turing machine halts on any input is undecidable.True
Both statement are correct.
So, option (A) is correct.
Quiz of this Question
Last Updated :
14 Sep, 2018
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...