Time for some prizes

1
Time for some prizes!

• A virtual cube of rooms, with one spot missing,
  that swaps positions every clock tick,
  disconnecting and reconnecting exits as
  appropriate Thomas Mildorf
• An MIT Assassins guild circle of death game
  every player has a target to kill, then acquiring
  their targets target Paige Phillips
• A Startrek episode complete with plot to be
  accomplished, holodeck, tribbles, Deanna Troi
  Brandon Moore
• A verb class methods that allow objects to
  perform actions on other objects Houyoung Chung
• Qidditch with brooms, flying-exits, the snitch
  Alan Browning
• Pokemon Chris Palmer
• Opinion polls with bureaucrats trying to
  influence opinions debate is over General
  Wizarding Institute Requirements David Bermejo
• Shape-shifters Aaron Bernstein
• Abstract object called charged-thing objects
  that can be used specific number of times,
  including use on final charge Aaron Bernstein
• Commerce system with gold, items for sale,
  merchants, system to monitor cash Sarah Krell

2
Turings Bombe
3
Turings history

• Worked as code breaker during WWII
• Key person in Ultra project, breaking Germans
  Enigma coding machine
• Designed and built the Bombe, machine for
  breaking messages from German Airforce

4
Turings history

• Worked as code breaker during WWII
• Key person in Ultra project, breaking Germans
  Enigma coding machine
• Designed and built the Bombe, machine for
  breaking messages from German Airforce (see next
  slide)
• Designed statistical methods for breaking
  messages from German Navy
• Spent considerable time determining counter
  measures for providing alternative sources of
  information so Germans wouldnt know Enigma
  broken
• Designed general-purpose digital computer based
  on this work
• Turing machine model of computation that
  underlies modern algorithms

5
A Turing Machine
More precisely, a Turing machine consists of A
TAPE which is divided into cells, one next to the
other. Each cell contains a symbol from some
finite alphabet, including a special blank
symbol. The tape is assumed to be arbitrarily
extendable to the left and to the right, i.e.,
the Turing machine is always supplied with as
much tape as it needs for its computation. Cells
that have not been written to before are assumed
to be filled with the blank symbol. A HEAD that
can read and write symbols on the tape and move
the tape left and right one (and only one) cell
at a time. A TABLE ("action table", or
transition function) of instructions that, given
the state the machine is currently in and the
symbol it is reading on the tape tells the
machine to do the following in sequence (i)
either erase or write a symbol, and then (ii)
move the head ('L' for one step left or 'R' for
one step right), and then (iii) assume the same
or a new state as prescribed. A STATE REGISTER
that stores the state of the Turing table. The
number of different states is always finite and
there is one special start state with which the
state register is initialized. Turing defined
this as a "note of instructions" to preserve the
computation of the "computer" (a person) who is
working in a "desultory manner" "This note is
the counterpart of the 'state of
mind'."(Undecidable, p. 139) Note that every
part of the machine -- its state- and
symbol-collections -- and its actions --
printing, erasing and tape motion -- is finite,
discrete and distinguishable it is the
potentially unlimited amount of tape that gives
it an unbounded amount of storage space.
6
Turings history

• Worked as code breaker during WWII
• Key person in Ultra project, breaking Germans
  Enigma coding machine
• Designed and built the Bombe, machine for
  breaking messages from German Airforce (see next
  slide)
• Designed statistical methods for breaking
  messages from German Navy
• Spent considerable time determining counter
  measures for providing alternative sources of
  information so Germans wouldnt know Enigma
  broken
• Designed general-purpose digital computer based
  on this work
• Turing machine model of computation that
  underlies modern algorithms
• Turing test argued that intelligence can be
  described by an effective procedure foundation
  for AI
• World class marathoner fifth in Olympic
  qualifying (24603 10 minutes off Olympic
  pace)
• Working on computational biology how nature
  computes biological forms.
• His death