turing, computing machinery and intelligence · 2017. 9. 27. · computing machinery and...

10
COMPUTING MACHINERY AND INTELLIGENCE Alan M. Turing

Upload: others

Post on 02-Feb-2021

4 views

Category:

Documents


0 download

TRANSCRIPT

  • COMPUTING MACHINERY AND INTELLIGENCEAlan M. Turing

  • ALAN TURING (1912-1954)

    ➤ father of computer science ➤ led cracking of Nazi Enigma code ➤ convicted of “indecency”, committed suicide

  • THE IMITATION GAME

  • TURING’S ARGUMENT (FIRST PASS)

    ➤Turing’s argument for (1): i. Prediction for 2000 AD: computers have 109 bits storage

    ii. >30% Turing test success ➤Turing’s comments on (2):

    ➤“Can computers think?” is vague.

    ➤“Can computers pass the Turing test?” is precise and worthy of investigation. ➤Objection: Same is true of

    “Does Higgs boson exist?”

    1. Computers will pass the Turing test.

    2. “Can computers pass the Turing test?” is a suitable replacement for “Can computers think?”.

    3. Therefore, computers will think.

  • TURING’S ARGUMENT (SECOND PASS)

    ➤(2’) says passing necessary for thinking.

    ➤ Is (2’) plausible? ➤ Is argument valid?

    1. Computers will pass the Turing Test.

    2’ Computers think only if they pass the Turing Test.

    3. Therefore, computers will think.

  • TURING’S ARGUMENT (FINAL PASS)

    ➤(2’’) says passing sufficient for thinking

    ➤ Is (2’’) plausible? ➤ Is argument valid? ➤Possible argument for (2’’):

    iii. Simulating human behavior sufficient for thinking.

    iv. Passing Turing test sufficient for simulating human behavior.

    1. Computers will pass the Turing Test.

    2’’ Computers think if they pass the Turing Test.

    3. Therefore, computers will think.

  • OBJECTIONS AND REPLIES

    ➤ Turing’s focus:

    1. Computers will pass the Turing Test.

    2’ Computers think only if they pass the Turing Test.

    iv. Passing Turing test sufficient for simulating human behavior.

    ➤ Modern day focus:

    iii. Simulating human behavior sufficient for thinking.

  • ADA LOVELACE

    (1815-1852)➤ worked on Babbage’s Analytical Engine ➤ first computer programmer ➤ daughter of Lord Byron

  • Ada Lovelace: “The Analytical Engine has no pretensions to originate anything. It can do whatever we know how to order it to perform.”

  • LOVELACE’S OBJECTION TO TURING’S ARGUMENT

    ➤Possible argument for (2):

    iii. Simulating human behavior sufficient for thinking.

    iv. Passing Turing test sufficient for simulating human behavior.

    ➤What does Lovelace object to? ➤Turing’s reply: human

    behavior less original than we think

    1. Computers will pass the Turing Test.

    2’’ Computers think if they pass the Turing Test.

    3. Therefore, computers will think.