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

Question

Quizplus · Accepted Answer

The Answer of 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

If a Turing Machine Halts for Each and Every World