Question 10563 – Theory-of-Computation
February 13, 2024Question 10565 – Theory-of-Computation
February 13, 2024Question 10564 – Theory-of-Computation
Choose the correct alternatives (More than one may be correct).
It is undecidable whether:
Correct Answer: E
Question 32 Explanation:
A) An arbitrary TM halts after 100 steps is decidable. We can run TM for 100 steps and conclude that.
B) A TM prints a specific letter is undecidable.
C) A TM computes the products of two numbers is undecidable. Eventhough we can design a TM for calculation product of 2 numbers but here it is asking whether given TM computes product of 2 numbers, so the behavior of TM unknown hence, undecidable.
B) A TM prints a specific letter is undecidable.
C) A TM computes the products of two numbers is undecidable. Eventhough we can design a TM for calculation product of 2 numbers but here it is asking whether given TM computes product of 2 numbers, so the behavior of TM unknown hence, undecidable.
An arbitrary Turing machine halts after 100 steps.
A Turing machine prints a specific letter.
A Turing machine computes the products of two numbers.
None of the above.
Both (B) and (C).
Subscribe
Login
0 Comments