Register

Turing Machines Theory

632 views

1 Answer

Best answer
4 4 votes

 Turing Recognizable recursive enumerable 

Turing Decidable recursive language

 

• selected by
Voting & Accepting an answer helps improve the community
← Previous · Gate books enquiryNext → · Master slave jk flip...
← Previous in category · languageNext in category → · turing machine
Position:
Show:

Related questions

1 1 vote
0 0 answers
747
747 views
rahul sharma 5 asked Aug 8, 2017
747 views
Turing Machines Deciadability
L ={ T | e(T) belongs to L(T) } , e(T) is the code for turing machine?The answer given is RE but not REC ,but cant we apply Rice theorem as follow-Tyes={Any machine accep...
3 3 votes
2 answers 2 answers
1.5k
1.5k views
rahul sharma 5 asked Aug 7, 2017
1,511 views
TOC Turing machines Decidability
Check whether the language below is recursive, recursively enumerable but not recursive, or not recursively enumerable?L={⟨M⟩∣ M halts on all palindromes}.How can i use R...
2 2 votes
2 2 answers
1.1k
1.1k views
rahul sharma 5 asked Aug 7, 2017
1,092 views
Turing machines decidability
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(M1)∖L(M2)}...
2 2 votes
0 0 answers
760
760 views
rahul sharma 5 asked Aug 5, 2017
760 views
TOC:- Turing Machines Decidiability
Please help in classifying above languages