5. 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

By ayush goel in 27 Sep 2023 | 11:55 am
ayush goel

ayush goel

 Student
Posts: 346
Member since: 21 Sep 2023

5. 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
27 Sep 2023 | 11:55 am
0 Likes

Report

Please describe about the report short and clearly.