edited by
525 views

1 Answer

Best answer
3 votes
3 votes

1) True

2) No , Now it's RE language.

REC=Turing Computable

When we say some function f(x) is computable then we basically means that there exists an algorithm to do the computation of that function. And when there exists an algorithm then we have answer for YES as well as NO(for member and non-member of language)and in that way the language becomes REC(recursive).

RE=Turing Acceptable=Semi Decidable=Turing Recognizable=Turing Enumerable

If some language is accepted by Turing machine then

Members of the language will halt in final state and Non-members may halt in non-final state or hang.

selected by

Related questions

3 votes
3 votes
2 answers
2
3 votes
3 votes
1 answer
3
3 votes
3 votes
2 answers
4