Turing machine problem to getting startet

markonan
Messages
1
Reaction score
0
Good everning!

I am currently working on problems related to turing machines.

Lets say we have a turing machine T . Vi can see the Turing machine driving in state 1, state 2 and so forth. If we do this we can set it up as a table. see under.

in my head it will look like this (R is a marked square, this is the square that is read from and written to)

x x x x x R x x x
x x x x x x R x x
x x x x x x x R x
x x x x x x R x x
x x x x x R x x x
x x x x R x x x x
x x x R x x x x x
x x x x R x x x x
x x x R x x x x x

what in the table above ansver to the tape in the turing machine at a given time?

//RESOURCES
With regards to a Turing machine, time complexity is a measure of how many times the tape moves when the machine is started on some input. Space complexity refers to how many cells of the tape are written to when the machine runs.

will time correspond to how many times the tape moves at an input at start? And how will i explain(calculate) this in the stated problem above?



And space, will that be how many cells in the figure above that is written to? won't this then be the number of R's?

I don't know how to attack this problem. Any tips and hints will be good.

Also i want to say sorry for the language, i know it's bad :)

Thanks to the people willing to take a look at this!

And it don't know if this is the right place to post this post, but i did not find any better forums/places that corresponds to the problem stated above. '

Markonan
 
Physics news on Phys.org
markonan said:
in my head it will look like this (R is a marked square, this is the square that is read from and written to)
States are not positions on the tape.

what in the table above ansver to the tape in the turing machine at a given time?
I don't understand that question.

will time correspond to how many times the tape moves at an input at start? And how will i explain(calculate) this in the stated problem above?
What do you mean "at start"? Time corresponds to the number of steps, which corresponds to the number of movements on the tape.
And space, will that be how many cells in the figure above that is written to? won't this then be the number of R's?
No, just the length of the strip where an R appears at some point.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.

Similar threads

Replies
1
Views
1K
Replies
1
Views
2K
Replies
2
Views
1K
Replies
25
Views
4K
Replies
6
Views
2K
Replies
2
Views
1K
Replies
2
Views
2K
Back
Top