1 / 26

QUIZ

QUIZ. In the 1930’s computers were much slower at performing complex calculations than they are today. Yet 30’s era computers were much more lifelike than today’s machines. How is this possible?. Alan Turing. 1912 – 1954. Almost impossible to understand his accomplishments from today.

palmer-mcfarland
Télécharger la présentation

QUIZ

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. QUIZ In the 1930’s computers were much slower at performing complex calculations than they are today. Yet 30’s era computers were much more lifelike than today’s machines. How is this possible?

  2. Alan Turing 1912 – 1954

  3. Almost impossible to understand his accomplishments from today.

  4. EntscheidungsproblemThe Decision Problem Could there exist, at least in principle, a definite method or process by which it could be decided whether any given mathematical assertion was provable? This is not asking for the proof mind you, just a yes or no answer to the question.

  5. Universal Turing Machine Turing proposes a theoretical machine to answer the Halting problem which in turn answers the Understanding problem. This Universal Turing Machine would be a clean slate that could be “programmed” to solve each problem. The UTC was a machine that could compute any function that has an algorithm (a finite sequence of instructions) given that the machine had unlimited storage and unlimited time.  • The term “Turing Complete” is still used today. • A Turing Machine can do the work of any other Turing Machine.

  6. Bletchley Park

  7. Enigma Machine

  8. The Germans were confident that the machine’s messages was unhackable, even if the Allies got one, because there was a “key” that was used each day.

  9. De-cyphering • The Polish had recovered an enigma machine very early in the war but, the hardware changed. • Turing wanted to create a “universal” machine that could quickly translate the messages. • Social engineering Nazi hubris was as important as the machine itself. • They had to ignore their own intelligence.

  10. After the War

  11. Computing Machinery and intelligence • Turing defines the debate about thinking machines in “Computing Machinery and Intelligence”. The article is a rebuttal of the usual arguments against A.I.

  12. Q: Can a machine think? • Q: If not, can a machine fool you into thinking it thinks? • Q: If yes, is it thinking? (explain your answer) • Bonus Q: are we living in a simulation? (please provide proof)

  13. The Turing Test • Based on the “Imitation Game” • The article was written in Mind magazine. • Old school chaterbot • New School user supplied intelligence.

  14. Problems with the test • It requires a definition of intelligence. • Treats the mind as separate from the body • Uses “silencing strategies”

  15. Turing’s Death • Arrested in 1952 for dating a man in Manchester. • Forced to take estrogen injections and put under house arrest. • Committed suicide in 1954 • ??

  16. Nam Jun Paik 1937-2006

  17. • Korean born, studied in Germany • Friends with John Cage and Joseph Beuys • Fluxus (neo-dada) • brought his Zen religion into his artwork • invented the term “Information Superhighway” in 1974

  18. With Charlotte Moorman

More Related