Monday, 1 April 2019

UGC NET Computer Science July 2018 - II Question 40

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 ?
  1. (1) Both S1 and S2 are correct
  2. (2) Both S1 and S2 are not correct
  3. (3) Only S1 is correct
  4. (4) Only S2 is correct
Answer: (1) Both S1 and S2 are correct

No comments:

Post a Comment

UGC NET Computer Science December 2019 | Question 16

Question 16 In a certain coding language. 'AEIOU' is written as 'TNHDZ'. Using the same coding language. 'BFJPV' wil...

Popular Posts