Questions about turing-machines
Read more about turing-machines
python (65.2k questions)
javascript (44.3k questions)
reactjs (22.7k questions)
java (20.8k questions)
c# (17.4k questions)
html (16.3k questions)
r (13.7k questions)
android (13k questions)
Is the following language decidable? L = {<M> : M(x) is a Turing machine with running time bounded by 100|x|^2 + 200}
L = {<M> : M(x) is a Turing machine with running time bounded by 100|x|^2 + 200}
I think L is undecidable but I can't solve that. Please help me prove it. Thanks!
Wang
Votes: 0
Answers: 1
The difference between halting and accepting in a Turing machine
I use the textbook "an introduction to formal languages and automata", 6th edition by Peter Linz.
In Definition 11.2, it seems that a Turing machine "M accepts language L" and &quo...
RyanKao
Votes: 0
Answers: 1
Multi-thread context switching in register-less machine
As I know, multi-thread context switching is pre-emptive initiated by the OS, transparent from the perspective of thread. Generally, when context switching, OS saves all the register values and restor...
Sourav Kannantha B
Votes: 0
Answers: 0
L_mult={a^i b^ij c^j:i,j≥0}, what would be the graph of diagram machine
L_mult={a^i b^ij c^j:i,j≥0}, what would be the diagram of turing machine.
Here the number of b's will be equal to the number of a's times number of c's. How can draw the turning machine of this lanagu...
kowser66
Votes: 0
Answers: 0