Help explain this Turing machine notation

In summary, the graphic shows a Turing machine that scans the tape in a back-and-forth manner, starting out all white.
  • #1
mishima
561
34
Below is an image from a website article discussing a Turing machine. It is supposed to represent a Turing machine, but I don't really follow the notation. I assume this is part of Wolfram's book, "New Kind of Science", which I do not have a copy of. I have only ever seen a Turing machine represented as a 5-tuple (partial function that maps (s, x) to (s', x', d).

turing_rule.gif


article: http://blog.stephenwolfram.com/2007...-simplest-universal-turing-machine-is-proved/
 
Technology news on Phys.org
  • #2
The top row reads, machine state is "on" tape is red, yellow, white, machine state is "off", tape is red, yellow, white, and it represents the six possible conditions that this Turing machine might find oat any step.

The bottom row shows how this Turing machine will respond to the six conditions listed in the top row. The little black things indicate one of two machine states. Call them "on" and "off". The colors indicate what color will replace the color just read at the current position on the tape. The position of the new state marker indicates which direction the Turing machine will move the tape.

So, if the machine state is "on" and the spot on the tape is red, then the spot will be replaced with yellow, the machine state will remain "on", and the tape will be stepped to the left.

If the machine state is "on" and the spot on the tape is yellow, then the spot will be replaced with red, the machine state will remain "on", and the tape will be stepped to the left.

If the machine state is "on" and the spot on the tape is white, then the spot will be replaced with yellow, the machine state will switch to "off", and the tape will be stepped to the right.

and so on.
See http://en.wikipedia.org/wiki/Wolfram's_2-state_3-symbol_Turing_machine for more.

The "triangles graphic" at the top shows the state of the tape as it is changed by the Turing machine. On quick inspection, I would say that this machine tends to scan the tape back and forth until it hits white in continuously widening scans. The tapes starts out all white except for one red or yellow dot (at the top of the "triangles graphic") and then broadens with continued processing (in the down direction).
 
  • Like
Likes FactChecker and Medicol
  • #3
Thanks for the help!
 

What is a Turing machine notation?

Turing machine notation is a formal system used to describe the actions and operations of a Turing machine. It consists of a set of symbols, rules, and configurations that are used to represent the behavior of a Turing machine.

Why is Turing machine notation important?

Turing machine notation is important because it allows us to formally describe and analyze the capabilities and limitations of a Turing machine. It is also used in the field of computational complexity theory to classify problems and determine their solvability.

What are the main components of Turing machine notation?

The main components of Turing machine notation include the alphabet, states, transition rules, and the tape. The alphabet is a finite set of symbols that the Turing machine can read and write on the tape. The states represent the different states that the machine can be in. The transition rules dictate how the machine will move between states and read and write symbols on the tape.

How is Turing machine notation used to simulate computation?

Turing machine notation is used to simulate computation by providing a step-by-step description of the actions of a Turing machine. This allows us to analyze and understand the behavior of the machine, as well as determine whether a given problem can be solved by a Turing machine.

What are some common variations of Turing machine notation?

Some common variations of Turing machine notation include multi-tape Turing machines, non-deterministic Turing machines, and universal Turing machines. These variations allow for greater complexity and flexibility in the operations of a Turing machine.

Similar threads

  • Programming and Computer Science
Replies
29
Views
3K
  • Calculus and Beyond Homework Help
Replies
1
Views
1K
  • Programming and Computer Science
Replies
9
Views
1K
  • Programming and Computer Science
Replies
15
Views
1K
Replies
1
Views
1K
  • Engineering and Comp Sci Homework Help
Replies
2
Views
4K
  • Calculus and Beyond Homework Help
Replies
4
Views
2K
  • Set Theory, Logic, Probability, Statistics
Replies
16
Views
2K
  • Set Theory, Logic, Probability, Statistics
Replies
4
Views
3K
Replies
6
Views
3K
Back
Top