Register

TURING MACHINE

356 views
0 votes
0 votes
WHATS THE MAIN DIFFERENCE between RECURSIVELY ENUMARABLE but  not RECUSIVE

and NOT RECURSIVELY ENUMARABLE??????/

PLZ help me out with this
User Avatar

2 Answers

0 votes
0 votes
turing machine means recusive enumerable language for which there is three possibilities accept reject and looping hence due to looping we say Rec enum languages

note2:now TOTAL TUring m/c means recursive language for which there is only two possibilities either accept or reject so Recusrive ..
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
RahulVerma3 asked Apr 2
48 views
Theory of Computation | design of Turing Machine
Is this the correct Turing machine for the language $0^n 1^n0^n$? assuming $ at the end and begining of the input tape
Is this the correct Turing machine for the language $0^n 1^n0^n$?assuming $ at the end and begining of the input tape
User Avatar
3 votes
3 votes
2 answers
4
h4kr asked Dec 7, 2022
727 views
Turing machine question
I saw question where I saw this format being used: L1 = {<M> | L(M) = ϕ} What does exactly <M> mean and why is L(M) = ϕ, mentioned afterwards. Isn’t L() stands for language for something? If the language is equivalent to null, it contains nothing. Then what does it exactly mean?
I saw question where I saw this format being used:L1 = {<M | L(M) = ϕ}What does exactly <M mean and why is L(M) = ϕ, mentioned afterwards. Isn’t L() stands for langua...
User Avatar
Link Copied!