Solved

If a Turing Machine Halts for Each and Every World

Question 16

Multiple Choice

If a Turing machine halts for each and every world of a language L and rejects other, then L is said to be

A) recursive enumerable
B) recursive
C) context free language
D) none of these

Related Questions

Q11: In which of the stated below is

Q12: Choose the correct statement<br>A)recursive set ? recursive

Q13: The set which is not countable if

Q14: What is the reason behind a Turing

Q15: The number of symbols necessary to simulate

Q17: Which of the following statement is wrong?<br>A)power

Q18: A pushdown automata behaves like a Turing

Q19: Church's Thesis supports<br>A)a turing machine as a

Q20: We think of a Turing machine's transition

Q21: Four pairs are following; in each pair