344 views

1 Answer

Best answer
4 votes
4 votes

 Turing Recognizable recursive enumerable 

Turing Decidable recursive language

 

selected by

Related questions

2 votes
2 votes
2 answers
3
rahul sharma 5 asked Aug 7, 2017
658 views
Check whether the language below is recursive, recursively enumerable but not recursive, or not recursively enumerable?{⟨M1,M2⟩∣ M1 and M2 are two TMs, and ϵ∈L(M...
2 votes
2 votes
0 answers
4