Register

turing machine decidability

• edited by
322 views
0 votes
0 votes
Given a turing machine M ,state q, and  string 'w'
whether M ever moves its head to the left when started with input w
is decidable or undecidable  ? explain ?
• edited by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
2 answers
3
rahul sharma 5 asked Aug 7, 2017
667 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)}.
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...
User Avatar
Link Copied!