Embed Size (px)
Citation preview
The Imitation GameWhat else did Alan Turing do?
Jeff O’ConnellOhlone College
www.ohlone.edu/people/joconnell
Outline
Ciphers and the Enigma
Machine (early 1940s)
Turing Machines (1936)
The Imitation Game (1950)
Ciphers and the Enigma Machine
A B C D E F G H I J
K L M N O P Q R S T
U V W X Y Z
A B C D E F G H I J
a
K L M N O P Q R S T
U V W X Y Z
A B C D E F G H I J
a b c d e f g
K L M N O P Q R S T
h i j k l m n o p q
U V W X Y Z
r s t u v w
A B C D E F G H I J
x y z a b c d e f g
K L M N O P Q R S T
h i j k l m n o p q
U V W X Y Z
r s t u v w
A B C D E F G H I J
x y z a b c d e f g
K L M N O P Q R S T
h i j k l m n o p q
U V W X Y Z
r s t u v w
M A T H I S A
L O T O F F U N
A B C D E F G H I J
x y z a b c d e f g
K L M N O P Q R S T
h i j k l m n o p q
U V W X Y Z
r s t u v w
M A T H
j x q e
I S
f p
A
x
L O T
i l q
O F
l c
F U N
c r k
Vigenère Ciphers
M A T H
I S
A
L O T
O F
F U N
O H L O
M A T H
N E
I S
O
A
H L O
L O T
N E
O F
O H L
F U N
O H L O
M A T H
N E
I S
O
A
H L O
L O T
N E
O F
O H L
F U N
A B C D E F G H I J
0 1 2 3 4 5 6 7 8 9
K L M N O P Q R S T
10 11 12 13 14 15 16 17 18 19
U V W X Y Z
20 21 22 23 24 25
O H L O
M A T H
a
N E
I S
O
A
H L O
L O T
N E
O F
O H L
F U N
A B C D E F G H I J
0 1 2 3 4 5 6 7 8 9
K L M N O P Q R S T
10 11 12 13 14 15 16 17 18 19
U V W X Y Z
20 21 22 23 24 25
O H L O
M A T H
a h e v
N E
I S
v w
O
A
o
H L O
L O T
s z h
N E
O F
b j
O H L
F U N
t b y
A B C D E F G H I J
0 1 2 3 4 5 6 7 8 9
K L M N O P Q R S T
10 11 12 13 14 15 16 17 18 19
U V W X Y Z
20 21 22 23 24 25
The Enigma Machine
The Enigma MachineUsed to both encode and decode messages.
Initially had 3 wheels that were set each day to a predetermined configuration. (Later, more wheels were added to make it more difficult to crack).
As one key was pressed, another would light up giving the encoded (or decoded) letter.
Was designed so that a letter never mapped to itself.
Δ
Turing Machines
Turing wrote a paper called “On Computable Numbers, with an Application to the Entscheidungsproblem” in 1936.
Turing Machines
Turing wrote a paper called “On Computable Numbers, with an Application to the Entscheidungsproblem” in 1936.
Turing MachineTape – Divided into cells. Each cell contains a
symbol.
A Read/Write Head – Can read and write on the tape and move the tape left and right one (and only one) position at a time.
State Register – Stores the “state” of the machine.
A finite table of instructions.
Video
The Imitation Game
Computing Machinery and Intelligence written in 1950 by Alan Turing.
I propose to consider the question “Can machines think?”
It is played with three people, a man (A), a woman (B), and an interrogator (C) who may be of either sex. The interrogator stays in a room apart front the other two. The object of the game for the interrogator is to determine which of the other two is the man and which is the woman.
We now ask the question, "What will happen when a machine takes the part of A in this game?" Will the interrogator decide wrongly as often when the game is played like this as he does when the game is played between a man and a woman? These questions replace our original, "Can machines think?"
Movie
Further Reading/Watching Alan Turing
The Man Who Knew Too Much: Alan Turing and the Invention of the Computer
Caesar Ciphers https://www.khanacademy.org/computing/computer-science/cryptography/crypt/v/caesar-
cipher
Vigenère Ciphers
https://www.youtube.com/watch?v=9zASwVoshiM
Turing’s paper Computing Machinery and Intelligence
http://www.loebner.net/Prizef/TuringArticle.html
Turing Test
http://www.turing.org.uk/scrapbook/test.html
http://www.washingtonpost.com/news/morning-mix/wp/2014/06/09/a-computer-just-passed-the-turing-test-in-landmark-trial/
Turing Machines
Explained - https://www.youtube.com/watch?v=dNRDvLACg5Q
The Busy Beaver - https://www.youtube.com/watch?v=CE8UhcyJS0I
Thank You!
Jeff O’ConnellOhlone College
www.ohlone.edu/people/joconnell
