Turing machine problem to getting startet

Click For Summary
SUMMARY

The discussion centers on understanding Turing machines, specifically regarding time and space complexity. Time complexity is defined as the number of tape movements made by the Turing machine during execution, while space complexity refers to the number of tape cells that are written to, not merely the count of marked squares (R's). The participants clarify that time corresponds to the total number of steps taken, and space complexity is determined by the length of the tape segment that contains marked squares at any point during execution.

PREREQUISITES
  • Understanding of Turing machines and their operational mechanics
  • Familiarity with concepts of time complexity and space complexity
  • Basic knowledge of theoretical computer science
  • Ability to interpret state transitions in computational models
NEXT STEPS
  • Study the formal definition of Turing machines and their components
  • Learn about calculating time complexity in Turing machines
  • Explore space complexity analysis in computational models
  • Investigate examples of Turing machine simulations and their tape operations
USEFUL FOR

The discussion is beneficial for computer science students, theoretical computer scientists, and anyone interested in the complexities of Turing machines and computational theory.

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.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 25 ·
Replies
25
Views
4K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K