Question 40
40. Consider the following statements( ) :
S1 : There exists no algorithm for deciding if any two Turing machines M1 and M2 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 ?
S1 : There exists no algorithm for deciding if any two Turing machines M1 and M2 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 ?
Answer: (1) Both S1 and S2 are correct