It is undecidable whether:

PYQ GATE 1990

It is undecidable whether:

  1. A.

    An arbitrary Turing machine halts after 100100 steps.

  2. B.

    A Turing machine prints a specific letter.

  3. C.

    A Turing machine computes the products of two numbers

  4. D.

    None of the above.

Attempted by 42 students.

Sign up free to check your answer

Sign up free

Explore the full course: Theory Of Computation

Loading lesson…