Turing Machine: Structure and Operational Functionality

Structure and Operational Functionality of
The Turing Machine
11 — 13 — 2008
Sören Wellhöfer
History
Structure and Definition
Samples
Varieties
Computability
References
Table of Contents
1 History
2 Structure and Definition
3 Samples
4 Varieties
5 Computability
6 References
Sören Wellhöfer Structure and Operational Functionality of The Turing Machine

History
Samples
Varieties
Computability
References
Time frame — The 20th century
What were mathematicians working on?
• Rediscover Theory of Numbers

• Reduction of all math to fundamental logic

History
Samples
Varieties
Computability
References

• Arithmetics/computations by means of automatic formal
system

History
Samples
Varieties
Computability
References

system

History
Samples
Varieties
Computability
References

system

History
Samples
Varieties
Computability
References
What does it mean to be computable?
Turing’s achievements
• Proof of the possibility of a symbol-processing machine

• Simple operations according to rules

History
Samples
Varieties
Computability
References

• Instruction tables for machine’s moves = formal system

History
Samples
Varieties
Computability
References

• All computations logically feasible!

History
Samples
Varieties
Computability
References

→ wrote first programmes

History
Samples
Varieties
Computability
References

→ wrote first programmes

History
General Structure
Samples
Formal definition
Varieties
Action table
Computability
References
Elements of the Turing Machine
• Read/Write Head
• Infinetly long tape
• Divided into cells
• Cells containing symbols

History
General Structure
Samples
Formal definition
Varieties
Action table
Computability
References
• Read/Write Head
• Action table = the program

History
General Structure
Samples
Formal definition
Varieties
Action table
Computability
References
• Read/Write Head
• Action table = the program

History
General Structure
Samples
Formal definition
Varieties
Action table
Computability
References
The Turing Machine
1
0 1
0 1
0 0 0 0 0 1
0 1
0 1
0
Infinetly long ...

History
General Structure
Samples
Formal definition
Varieties
Action table
Computability
References
The Turing Machine
Tape
1
0 1
0 1
0 0 0 0 0 1
0 1
0 1
0
Infinetly long ...

History
General Structure
Samples
Formal definition
Varieties
Action table
Computability
References
The Turing Machine
Tape
1
0 1
0 1
0 0 0 0 0 1
0 1
0 1
0
Infinetly long ...

History
General Structure
Samples
Formal definition
Varieties
Action table
Computability
References
The Turing Machine
Tape
1
0 1
0 1
0 0 0 0 0 1
0 1
0 1
0
Infinetly long ...

History
General Structure
Samples
Formal definition
Varieties
Action table
Computability
References
The Turing Machine
Tape
1
0 1
0 1
0 0 0 0 0 1
0 1
0 1
0
Infinetly long ...

History
General Structure
Samples
Formal definition
Varieties
Action table
Computability
References
The Turing Machine
Read/Write Head
Tape
1
0 1
0 1
0 0 0 0 0 1
0 1
0 1
0
Infinetly long ...

History
General Structure
Samples
Formal definition
Varieties
Action table
Computability
References
The Turing Machine
Read/Write Head
Tape
1
0 1
0 1
0 0 0 0 0 1
0 1
0 1
0
Infinetly long ...

History
General Structure
Samples
Formal definition
Varieties
Action table
Computability
References
The Turing Machine
Read/Write Head
Tape
1
0 1
0 1
0 0 0 0 0 1
0 1
0 1
0
Infinetly long ...

History
General Structure
Samples
Formal definition
Varieties
Action table
Computability
References
The Turing Machine
Read/Write Head
Tape
Machine’s State
1
0 1
0 1
0 0 0 0 0 1
0 1
0 1
0
Infinetly long ...

History
General Structure
Samples
Formal definition
Varieties
Action table
Computability
References
The Turing Machine
Read/Write Head
Tape
Machine’s State
1
0 1
0 1
0 0 0 0 0 1
0 1
0 1
0
Infinetly long ...

History
General Structure
Samples
Formal definition
Varieties
Action table
Computability
References
The Turing Machine
Read/Write Head
Now action according

to state table Machine’s State
1
0 1
0 1
0 0 0 0 0 1
0 1
0 1
0

History
General Structure
Samples
Formal definition
Varieties
Action table
Computability
References
The Turing Machine

State table might say: Read/Write Head
When in state A reading 0:
write 1, move right, change
state to B.
Machine’s State
1
0 1
0 1
0 0 0 0 0 1
0 1
0 1
0

History
General Structure
Samples
Formal definition
Varieties
Action table
Computability
References
The Turing Machine

state to B.
Machine’s State
1
0 1
0 1
0 0 1 0 0 1
0 1
0 1
0

History
General Structure
Samples
Formal definition
Varieties
Action table
Computability
References
The Turing Machine

state to B.
Machine’s State
Move right A
1
0 1
0 1
0 0 1 0 0 1
0 1
0 1
0

History
General Structure
Samples
Formal definition
Varieties
Action table
Computability
References
The Turing Machine

State table might say:
state to B.
Move right A
1
0 1
0 1
0 0 1 0 0 1
0 1
0 1
0

History
General Structure
Samples
Formal definition
Varieties
Action table
Computability
References
The Turing Machine

State table might say:
state to B.
New state B
B
1
0 1
0 1
0 0 1 0 0 1
0 1
0 1
0

History
General Structure
Samples
Formal definition
Varieties
Action table
Computability
References
The Turing Machine
Now read again, etc ...
... until final configuration.
1
0 1
0 1
0 0 1 0 0 1
0 1
0 1
0

History
General Structure
Samples
Formal definition
Varieties
Action table
Computability
References
Formal definition — 7-tupel
M = hS, Γ, b, Σ, δ, s0 , F i
S Finite set of states

History
General Structure
Samples
Formal definition
Varieties
Action table
Computability
References
M = hS, Γ, b, Σ, δ, s0 , F i

Γ Finite set of symbols

History
General Structure
Samples
Formal definition
Varieties
Action table
Computability
References
M = hS, Γ, b, Σ, δ, s0 , F i

b∈Γ Blank symbol

History
General Structure
Samples
Formal definition
Varieties
Action table
Computability
References
M = hS, Γ, b, Σ, δ, s0 , F i

b∈Γ Blank symbol
Σ ⊆ Γ \ {b} Input symbols

History
General Structure
Samples
Formal definition
Varieties
Action table
Computability
References
M = hS, Γ, b, Σ, δ, s0 , F i

b∈Γ Blank symbol
δ : S × Γ × {L, R} Finite set of states

History
General Structure
Samples
Formal definition
Varieties
Action table
Computability
References
M = hS, Γ, b, Σ, δ, s0 , F i

b∈Γ Blank symbol
s0 ∈ S Initial state

History
General Structure
Samples
Formal definition
Varieties
Action table
Computability
References
M = hS, Γ, b, Σ, δ, s0 , F i

b∈Γ Blank symbol
F ⊆S Accepting states

History
General Structure
Samples
Formal definition
Varieties
Action table
Computability
References
M = hS, Γ, b, Σ, δ, s0 , F i

b∈Γ Blank symbol

History
General Structure
Samples
Formal definition
Varieties
Action table
Computability
References
M = hS, Γ, b, Σ, δ, s0 , F i

b∈Γ Blank symbol

History
General Structure
Samples
Formal definition
Varieties
Action table
Computability
References
Action table/Transition function δ — Quintupel
si aj −→ si1 aj1 dk
When in state si reading symbol aj :

History
General Structure
Samples
Formal definition
Varieties
Action table
Computability
References
• write symbol aj1

History
General Structure
Samples
Formal definition
Varieties
Action table
Computability
References

• move into dk , k ∈ {L, R}

History
General Structure
Samples
Formal definition
Varieties
Action table
Computability
References

• change state to si1

History
General Structure
Samples
Formal definition
Varieties
Action table
Computability
References


History
General Structure
Samples
Formal definition
Varieties
Action table
Computability
References


History
Addition
Samples
Class activity
Varieties
Complement
Computability
References
Unary Numbers
n−→u n=m
1−→X u... number of Xs
5−→XXXXX n... natural number

History
Addition
Samples
Class activity
Varieties
Complement
Computability
References
Unary Number Addition — Self-performed
Simulating a Turing Machine:
Now it’s your turn!

History
Addition
Samples
Class activity
Varieties
Complement
Computability
References
Unary Number Addition Machine
S ={0, 1, HALT} Γ={B, X, +}

F ={HALT} Σ={X, +}

History
Addition
Samples
Class activity
Varieties
Complement
Computability
References
S ={0, 1, HALT} Γ={B, X, +}

F ={HALT} Σ={X, +}
s0 =0 b=B

History
Addition
Samples
Class activity
Varieties
Complement
Computability
References
S ={0, 1, HALT} Γ={B, X, +}

F ={HALT} Σ={X, +}
s0 =0 b=B
Action table δ si = 0 si = 1

History
Addition
Samples
Class activity
Varieties
Complement
Computability
References
S ={0, 1, HALT} Γ={B, X, +}

F ={HALT} Σ={X, +}
s0 =0 b=B
aj = X si1 = 0; aj1 = X; dK = R si1 = HALT; aj1 = B; dK = R

History
Addition
Samples
Class activity
Varieties
Complement
Computability
References
S ={0, 1, HALT} Γ={B, X, +}

F ={HALT} Σ={X, +}
s0 =0 b=B
aj = + si1 = 0; aj1 = X; dK = R —

History
Addition
Samples
Class activity
Varieties
Complement
Computability
References
S ={0, 1, HALT} Γ={B, X, +}

F ={HALT} Σ={X, +}
s0 =0 b=B
aj = + si1 = 0; aj1 = X; dK = R —
aj = B si1 = 1; aj1 = B; dK = L —

History
Addition
Samples
Class activity
Varieties
Complement
Computability
References
S ={0, 1, HALT} Γ={B, X, +}

F ={HALT} Σ={X, +}
s0 =0 b=B
aj = + si1 = 0; aj1 = X; dK = R —
aj = B si1 = 1; aj1 = B; dK = L —

History
Addition
Samples
Class activity
Varieties
Complement
Computability
References
A Complement Machine
S ={0, HALT} Γ={B, 0, 1}

F ={HALT} Σ={0, 1}

History
Addition
Samples
Class activity
Varieties
Complement
Computability
References
S ={0, HALT} Γ={B, 0, 1}

F ={HALT} Σ={0, 1}
s0 =0 b=B

History
Addition
Samples
Class activity
Varieties
Complement
Computability
References
S ={0, HALT} Γ={B, 0, 1}

F ={HALT} Σ={0, 1}
s0 =0 b=B
Action table δ si = 0

History
Addition
Samples
Class activity
Varieties
Complement
Computability
References
S ={0, HALT} Γ={B, 0, 1}

F ={HALT} Σ={0, 1}
s0 =0 b=B
aj = 0 si1 = 0; aj1 = 1; dK = R

History
Addition
Samples
Class activity
Varieties
Complement
Computability
References
S ={0, HALT} Γ={B, 0, 1}

F ={HALT} Σ={0, 1}
s0 =0 b=B
aj = 0 si1 = 0; aj1 = 1; dK = R
aj = 1 si1 = 0; aj1 = 0; dK = R

History
Addition
Samples
Class activity
Varieties
Complement
Computability
References
S ={0, HALT} Γ={B, 0, 1}

F ={HALT} Σ={0, 1}
s0 =0 b=B
aj = 0 si1 = 0; aj1 = 1; dK = R
aj = 1 si1 = 0; aj1 = 0; dK = R
aj = B si1 = HALT; aj1 = B; dK = R

History
Addition
Samples
Class activity
Varieties
Complement
Computability
References
S ={0, HALT} Γ={B, 0, 1}

F ={HALT} Σ={0, 1}
s0 =0 b=B
aj = 0 si1 = 0; aj1 = 1; dK = R
aj = 1 si1 = 0; aj1 = 0; dK = R
aj = B si1 = HALT; aj1 = B; dK = R

History
Variations
4-tupel
Samples
State diagrams
Varieties
Instantaneous description
Computability
Universal Turing Machine
References
Variations of the TMs ...
... provably equivalent
• Two-way infinite tapes

• Arbitrary movement of the head
• Arbitrary numbers of read-write heads
• Arbitrary finite alphabet

History
Variations
4-tupel
Samples
State diagrams
Varieties
Computability
References
Variations of the TMs ...
... provably equivalent
• Two-way infinite tapes

• Arbitrary movement of the head
• Arbitrary numbers of read-write heads
• Arbitrary finite alphabet

History
Variations
4-tupel
Samples
State diagrams
Varieties
Computability
References
4-tupel representation
asi −→ si1 dk
When in state si reading symbol a:

History
Variations
4-tupel
Samples
State diagrams
Varieties
Computability
References
asi −→ si1 dk

History
Variations
4-tupel
Samples
State diagrams
Varieties
Computability
References
asi −→ si1 dk

• Take action d: move right/left or
write

History
Variations
4-tupel
Samples
State diagrams
Varieties
Computability
References
asi −→ si1 dk

• Take action d: move right/left or
write

History
Variations
4-tupel
Samples
State diagrams
Varieties
Computability
References
State diagram: successor of a unary number

History
Variations
4-tupel
Samples
State diagrams
Varieties
Computability
References

History
Variations
4-tupel
Samples
State diagrams
Varieties
Computability
References
A Turing Machine in an instantaneous state.

History
Variations
4-tupel
Samples
State diagrams
Varieties
Computability
References
Features
• Emulates δ of other Turing Machines
• Von Neumann architecture

History
Variations
4-tupel
Samples
State diagrams
Varieties
Computability
References
Features
• Turing-completeness

History
Variations
4-tupel
Samples
State diagrams
Varieties
Computability
References
Features
... 010110101111 00 101011011 00 110110110111 00

11010111011110 ...

History
Variations
4-tupel
Samples
State diagrams
Varieties
Computability
References
Features
... 010110101111 00 101011011 00 110110110111 00

11010111011110 ...

History
Samples
Varieties
Computability
References
Computability
Computable
• Any number if
TM-representable
√
(π, e, )
• Numerical functions
(+, −, × , ÷)

History
Samples
Varieties
Computability
References
Computability
Computable Incomputable
• Any number if • Entscheidungsproblem: Will
TM-representable any algorithm A with
√
(π, e, ) arbitrary input I halt?
• Numerical functions h(A, I ) is incomputable
(+, −, × , ÷)

History
Samples
Varieties
Computability
References
Computability
√
(+, −, × , ÷) • “Busy beaver” function
Σ(n)

History
Samples
Varieties
Computability
References
Computability
√
(+, −, × , ÷) • “Busy beaver” function
Σ(n)

History
Samples
Varieties
Computability
References
Church?Turing thesis
“Every effectively calculable function is a computable

function.”
• Effectively calculable: produced intuitively

• Computable function: computable by a Turing Machine

History
Samples
Varieties
Computability
References

function.”

Solvable by humans = Solvable by machines (algorithm)

History
Samples
Varieties
Computability
References

function.”

Solvable by humans = Solvable by machines (algorithm)

History
Samples
Varieties
Computability
References
The Universal Turing Machine: A Half-Century Survey

R. Herken
New York: Oxford University Press, 1988.
[http://plato.stanford.edu/entries/turing-machine/]
Turing Machines
Stanford Encyclopedia of Philosophy, 04.11.1995
[http://www.intelligentedu.com/turing machines examples.html]

Turing Machines: Examples
Jaime Soffer, 2005.
[http://en.wikipedia.org/wiki] Turing Machine, Busy Beaver,
Computability, Turing-completeness, Entscheidungsproblem,
11-03-2008

Turing Machine: Structure and Operational Functionality

Enviado por

Dados do documento

Direitos autorais

Formatos disponíveis

Compartilhar este documento

Compartilhar ou incorporar documento

Opções de compartilhamento

Você considera este documento útil?

Este conteúdo é inapropriado?

Direitos autorais:

Formatos disponíveis

Turing Machine: Structure and Operational Functionality

Enviado por

Direitos autorais:

Formatos disponíveis

Structure and Operational Functionality of

The Turing Machine

2 Structure and Definition

Sören Wellhöfer Structure and Operational Functionality of The Turing Machine

Time frame — The 20th century

What were mathematicians working on?

• Rediscover Theory of Numbers

Sören Wellhöfer Structure and Operational Functionality of The Turing Machine

Time frame — The 20th century

What were mathematicians working on?

• Rediscover Theory of Numbers

Sören Wellhöfer Structure and Operational Functionality of The Turing Machine

Time frame — The 20th century

What were mathematicians working on?

• Rediscover Theory of Numbers

Sören Wellhöfer Structure and Operational Functionality of The Turing Machine

Time frame — The 20th century

What were mathematicians working on?

• Rediscover Theory of Numbers

Sören Wellhöfer Structure and Operational Functionality of The Turing Machine

What does it mean to be computable?

• Proof of the possibility of a symbol-processing machine

Sören Wellhöfer Structure and Operational Functionality of The Turing Machine

What does it mean to be computable?

• Proof of the possibility of a symbol-processing machine

Sören Wellhöfer Structure and Operational Functionality of The Turing Machine

What does it mean to be computable?

• Proof of the possibility of a symbol-processing machine

Sören Wellhöfer Structure and Operational Functionality of The Turing Machine

What does it mean to be computable?

• Proof of the possibility of a symbol-processing machine

Sören Wellhöfer Structure and Operational Functionality of The Turing Machine

What does it mean to be computable?

• Proof of the possibility of a symbol-processing machine

Sören Wellhöfer Structure and Operational Functionality of The Turing Machine

Elements of the Turing Machine

Sören Wellhöfer Structure and Operational Functionality of The Turing Machine

Elements of the Turing Machine

Sören Wellhöfer Structure and Operational Functionality of The Turing Machine

Elements of the Turing Machine

Sören Wellhöfer Structure and Operational Functionality of The Turing Machine

The Turing Machine

Infinetly long ...

The Turing Machine

Infinetly long ...

The Turing Machine

Infinetly long ...

The Turing Machine

Infinetly long ...

The Turing Machine

Infinetly long ...

The Turing Machine

Infinetly long ...

The Turing Machine

Infinetly long ...

The Turing Machine

Infinetly long ...

The Turing Machine

Infinetly long ...

The Turing Machine

Infinetly long ...

The Turing Machine

Now action according

Sören Wellhöfer Structure and Operational Functionality of The Turing Machine