Register

Turing machine
closed

• closed by
255 views
0 votes
0 votes
closed as a duplicate of: turing machine plzz xplain
Consider <M> be the encoding of a TM as a string over the alphabet {0,1}. Consider L = {<M> | M is a TM that halts on all the input and L(M) = L' for some Undecidable language L' } then L is ?

A. Decidable and Recursive

B. Decidable and Non recursive

C. Undecidable and RE

D. Undecidable and Non RE
• closed by
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
Shubham Kumar Gupta asked Dec 23, 2017
593 views
Turing Machine
A. L is undecidable B. L is decidable C. L is regular. D. None of these. Please explain in detail.
A. L is undecidableB. L is decidableC. L is regular.D. None of these.Please explain in detail.
User Avatar
1 votes
1 votes
1 answer
2
iarnav asked Nov 1, 2017
917 views
#TOC Turing Machine Question
For every deterministic Turing machine, there exists an equivalent deterministic Non Deterministic Turing machine. I know, other way is correct i.e for every DTM there exist a NDTM, but is above TRUE/FALSE. Thank you!
For every deterministic Turing machine, there exists an equivalent deterministic Non Deterministic Turing machine.I know, other way is correct i.e for every DTM there exi...
User Avatar
0 votes
0 votes
1 answer
3
iarnav asked Oct 30, 2017
693 views
Turing Machine Question
The set of turning machines which halt on empty input forms a recursively enumerable set?! True or False. Please also state your reason/explanation. AFAIK - TM accept Epsilon if it sees a Blank and goes to accepting state. Thank you!
The set of turning machines which halt on empty input forms a recursively enumerable set?!True or False. Please also state your reason/explanation.AFAIK - TM accept Epsil...
User Avatar
0 votes
0 votes
0 answers
4
sripo asked Jan 5, 2019
544 views
Language accepted by this Turing Machine
As per the given solution,B should be the correct answer right why is D given as the correct answer as the machine accepts atleast one b.
As per the given solution,B should be the correct answer right why is D given as the correct answer as the machine accepts atleast one b.
User Avatar
Link Copied!