🎙 Free live masterclass · Sun, 29 Nov, 7:00 pm IST · Java Full Stack roadmap Register free →
Skills101
← Quiz: Turing Machines: all 10 questions

Quiz: Turing Machines · Question 10 of 10

A TM decides a language L when:

A TM decides a language L when:

  1. A.It accepts every string in L but may loop on others
  2. B.It halts on every input and gives the right yes/no answer
  3. C.It never halts
  4. D.It uses only one state
Answer & explanation

Correct answer: It halts on every input and gives the right yes/no answer

Recognising allows looping on strings outside L; deciding does not.

Can you get the rest right without peeking?

Take the timed Quiz: Turing Machines quiz free. Pass it to earn XP and count towards your certificate.

Start the quiz →