← 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:
- A.It accepts every string in L but may loop on others
- B.It halts on every input and gives the right yes/no answer
- C.It never halts
- 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 →