• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

GATE | GATE CS 2021 | Set 1 | Question 49

For a Turing machine M, ⟨M⟩ denotes an encoding of M. Consider the following two languages.
  • L1 = { ⟨M⟩ ∣ M takes more than 2021 steps on all inputs }
  • L2 = { ⟨M⟩ ∣ M takes more than 2021 steps on some input }
    • Which one of the following options is correct?

(A)

Both L1 and L2 are decidable

(B)

L1 is decidable and L2 is undecidable

(C)

L1 is undecidable and L2 is decidable

(D)

Both L1 and L2 are undecidable

Answer

Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :
Share your thoughts in the comments