This tag is suited for questions involving Turing machines. Not to be confused with finite state machines and finite automata.
0
votes
0answers
128 views
Turing Machine question, this is NOT HW
I was having a hard time understanding and solving this question that wants me to show the final tape and figuring out if whether or not the turning machine accepts it or not. I have a list of 20 ...
2
votes
1answer
146 views
Is this undecidable language recognizable?
Is this language:
$L = \{\langle M\rangle : \text{$M$ is a Turing machine and $L(M)$ is decidable}\}$
which I know that is undecidable, turing-recognizable?
Is its complement recognizable?
...
0
votes
0answers
31 views
Turing machine question [duplicate]
I was having a hard time understanding and solving this question that wants me to show the final tape and figuring out if whether or not the turning machine accepts it or not. I have a list of 20 ...
