Gordana Dodig-Crnkovic Department of Computer Science and Engineering Mälardalen University 2006
1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic,...
-
Upload
ethan-booth -
Category
Documents
-
view
217 -
download
0
description
Transcript of 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic,...
![Page 1: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/1.jpg)
1
IDT Open Seminar
ALAN TURING AND HIS LEGACY100 Years Turing
celebration
Gordana Dodig Crnkovic, Computer Science and Network Department
Mälardalen UniversityMarch 8th 2012
http://www.mrtc.mdh.se/~gdc/work/TuringCentenary.pdf
http://www.mrtc.mdh.se/~gdc/work/TuringMachine.pdf
![Page 2: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/2.jpg)
2
*aFinite Automata
Push-down Automatannba Rww
nnn cba ww
**ba
Turing Machines
Chomsky Language Hyerarchy
![Page 3: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/3.jpg)
TURING MACHINES
“Turing’s "Machines". These machines are humans who calculate.” (Wittgenstein)
“A man provided with paper, pencil, and rubber, and subject to strict discipline, is in effect a universal machine.” (Turing)
3
![Page 4: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/4.jpg)
4
............Tape
Read-Write headControl Unit
Turing Machine
![Page 5: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/5.jpg)
5
............
Read-Write head
No boundaries -- infinite length
The head moves Left or Right
The Tape
![Page 6: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/6.jpg)
6
............
Read-Write head
1. Reads a symbol2. Writes a symbol3. Moves Left or Right
The head at each time step:
![Page 7: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/7.jpg)
7
Head starts at the leftmost positionof the input string
............
Blank symbol
head
a b ca
Input string
The Input String
#####
![Page 8: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/8.jpg)
8
Determinism
1q
2qRba ,
Allowed Not Allowed
3qLdb ,
1q
2qRba ,
3qLda ,
No lambda transitions allowed in TM!
Turing Machines are deterministic
![Page 9: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/9.jpg)
9
Determinism
Note the difference between state indeterminismwhen not even possible future states are known in advance.
and choice indeterminismwhen possible future states are known,but we do not know which state will be taken.
![Page 10: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/10.jpg)
10
Halting
The machine halts if there are no possible transitions to follow
![Page 11: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/11.jpg)
11
Example
............ a b ca
1q
1q
2qRba ,
3qLdb ,
No possible transition
HALT!
# # # # #
![Page 12: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/12.jpg)
12
Final States
1q 2q Allowed
1q 2q Not Allowed
• Final states have no outgoing transitions• In a final state the machine halts
![Page 13: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/13.jpg)
13
Acceptance
Accept Input If machine halts in a final state
Reject Input
If machine halts in a non-final state or If machine enters an infinite loop
![Page 14: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/14.jpg)
14
Formal Definitions for
Turing Machines
![Page 15: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/15.jpg)
15
Transition Function
1q 2qRba ,
),,(),( 21 Rbqaq
![Page 16: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/16.jpg)
16
1q 2qLdc ,
),,(),( 21 Ldqcq
Transition Function
![Page 17: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/17.jpg)
17
Turing Machine
),#,,,,,( 0 FqQM
Transitionfunction
Initialstate
blank
Finalstates
States
Inputalphabet
Tapealphabet
![Page 18: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/18.jpg)
18
For any Turing Machine M
}:{)( 210 xqxwqwML f
Initial state Final state
The Accepted Language
![Page 19: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/19.jpg)
19
Standard Turing Machine
• Deterministic
• Infinite tape in both directions
•Tape is the input/output file
The machine we described is the standard:
![Page 20: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/20.jpg)
20
Computing Functionswith
Turing Machines
![Page 21: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/21.jpg)
21
)(0 wfqwq f
Initial Configuration
FinalConfiguration
Dw DomainFor all
A function is computable ifthere is a Turing Machine such that
fM
![Page 22: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/22.jpg)
22
Example (Addition)
The function yxyxf ),( is computable
Turing Machine:
Input string: yx0 unary
Output string: 0xy unary
yx, are integers
![Page 23: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/23.jpg)
23
Start
Finish 0
fq
11
yx
11
final state
0
0q
1 11 1
x y
1
initial state
# #
# #
![Page 24: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/24.jpg)
24
0q 1q 2q 3qL,## L,01
L,11
R,##
R,10
R,11
4q
R,11
Turing machine for function yxyxf ),(
![Page 25: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/25.jpg)
25
Execution Example:
11x
11y
Time 0
0
0q
1 11 1x y
Final Result
0
4q
1 11 1yx
(2)
(2)
# #
# #
![Page 26: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/26.jpg)
26
Time 0 0
0q
1 11 1
0q 1q 2q 3qL,01
L,11
R,10
R,11
4q
R,11
# #
L,##
R,##
yxyxf ),(
![Page 27: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/27.jpg)
27
0q
01 11 1Time 1
0q 1q 2q 3qL,01
L,11
R,10
R,11
4q
R,11
# #
L,##
R,##
yxyxf ),(
![Page 28: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/28.jpg)
28
0
0q
1 11 1Time 2
0q 1q 2q 3qL,01
L,11
R,10
R,11
4q
R,11
# #
L,##
R,##
yxyxf ),(
![Page 29: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/29.jpg)
29
1q
1 11 11Time 3
0q 1q 2q 3qL,01
L,11
R,10
R,11
4q
R,11
# #
L,##
R,##
yxyxf ),(
![Page 30: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/30.jpg)
30
1q
1 11 11Time 4
0q 1q 2q 3qL,01
L,11
R,10
R,11
4q
R,11
# #
L,##
R,##
yxyxf ),(
![Page 31: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/31.jpg)
31
1q
1 11 11Time 5
0q 1q 2q 3qL,01
L,11
R,10
R,11
4q
R,11
# #
L,##
R,##
yxyxf ),(
![Page 32: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/32.jpg)
32
2q
1 11 11Time 6
0q 1q 2q 3qL,01
L,11
R,10
R,11
4q
R,11
# #
L,##
R,##
yxyxf ),(
![Page 33: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/33.jpg)
33
3q
1 11 01Time 7
0q 1q 2q 3qL,01
L,11
R,10
R,11
4q
R,11
# #
L,##
R,##
yxyxf ),(
![Page 34: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/34.jpg)
34
3q
1 11 01Time 8
0q 1q 2q 3qL,01
L,11
R,10
R,11
4q
R,11
# #
L,##
R,##
yxyxf ),(
![Page 35: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/35.jpg)
35
3q
1 11 01Time 9
0q 1q 2q 3qL,01
L,11
R,10
R,11
4q
R,11
# #
L,##
R,##
yxyxf ),(
![Page 36: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/36.jpg)
36
3q
1 11 01Time 10
0q 1q 2q 3qL,01
L,11
R,10
R,11
4q
R,11
# #
L,##
R,##
yxyxf ),(
![Page 37: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/37.jpg)
37
3q
1 11 01Time 11
0q 1q 2q 3qL,01
L,11
R,10
R,11
4q
R,11
# #
L,##
R,##
yxyxf ),(
![Page 38: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/38.jpg)
38
4q
1 11 01
0q 1q 2q 3qL,01
L,11
R,10
R,11
4q
R,11
HALT & accept
Time 12 # #
L,##
R,##
yxyxf ),(
![Page 39: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/39.jpg)
39
Universal Turing Machine
![Page 40: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/40.jpg)
40
A limitation of Turing Machines:
Turing Machines are “hardwired”
they executeonly one program
![Page 41: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/41.jpg)
41
Solution: Universal Turing Machine
• Reprogrammable machine
• Simulates any other Turing Machine
Characteristics:
![Page 42: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/42.jpg)
42
Universal Turing Machine
simulates any other Turing Machine M
Input to Universal Turing Machine:
• Description of transitions ofM• Initial tape contents of M
![Page 43: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/43.jpg)
43
Universal Turing Machine
Description of Three tapes
MTape Contents of
Tape 2
State of M
Tape 3
M
Tape 1
![Page 44: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/44.jpg)
44
We describe Turing machine as a string of symbols:
We encode as a string of symbols
M
M
Description of M
Tape 1
![Page 45: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/45.jpg)
45
Alphabet Encoding
Symbols: a b c d
Encoding: 1 11 111 1111
![Page 46: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/46.jpg)
46
State Encoding
States: 1q 2q 3q 4q
Encoding: 1 11 111 1111
Head Move Encoding
Move:
Encoding:
L R
1 11
![Page 47: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/47.jpg)
47
Transition Encoding
Transition: ),,(),( 21 Lbqaq
Encoding: 10110110101
separator
![Page 48: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/48.jpg)
48
Machine Encoding
Transitions:
),,(),( 21 Lbqaq
Encoding:
10110110101
),,(),( 32 Rcqbq
110111011110101100
separator
![Page 49: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/49.jpg)
49
Tape 1 contents of Universal Turing Machine:
encoding of the simulated machine as a binary string of 0’s and 1’s
M
![Page 50: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/50.jpg)
50
As Turing Machine is described with a binary string of 0’s and 1’s
the set of Turing machines forms a language:
Each string of the language isthe binary encoding of a Turing Machine.
![Page 51: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/51.jpg)
51
Language of Turing Machines
L = { 010100101,
00100100101111,
111010011110010101, …… }
(Turing Machine 1)
(Turing Machine 2)
……
![Page 52: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/52.jpg)
52
Question:Do Turing machines have the same power with a digital computer?
Intuitive answer: Yes
There was no formal proof of Church-Turing thesis until 2008!
CHURCH TURING THESIS
![Page 53: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/53.jpg)
53
Dershowitz, N. and Gurevich, Y. A Natural Axiomatization of Computability and Proof of Church's Thesis, Bulletin of Symbolic Logic, v. 14, No. 3, pp. 299-350 (2008)
This formal proof of Church-Turing thesis relies on an axiomatization of computation that excludes randomness, parallelism and quantum computing and thus corresponds to the idea of computing that Church and Turing had.
![Page 54: 1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mlardalen University.](https://reader035.fdocuments.us/reader035/viewer/2022062600/5a4d1b927f8b9ab0599c1ec3/html5/thumbnails/54.jpg)
54
Turing’s thesis
Any computation carried outby algorithmic meanscan be performed by a Turing Machine. (1930)
http://www.engr.uconn.edu/~dqg/papers/myth.pdf The Origins of the Turing Thesis Myth Goldin & Wegner