HON 1010C Lecture Notes - Lecture 20: Turing Test, Christian Mortalism

• School: St. John's University
• Department: HON - HONORS
• Course: HON 1010C
• Professor: Denis Sullivan

Document Summary

Philosophy 1010c: created contemporary logic system in which anything that can be deduced is deduced, algorithm euclid"s algorithm, technique of finding the smallest common denominator between two numbers, you are guaranteed to eventually arrive at an answer. Small # - divided into large # If remainder is 0, the small # is your common denominator: otherwise, the leftover is called remainder #1. Remainder #1 divided into large # If remainder is 0, the remainder #1 is your common denominator: otherwise, the leftover is called remainder #2. Remainder #2 divided into large # It is (or has the capability to be) smarter than humans. Topics discussed by alan turing in his writing: turing test, a test to see whether a machine can duplicate, or surpass, human thought/knowledge, how it works: Man pretends to be a woman (goal is to convince the i(cid:374)terrogator that (cid:858)he(cid:859) is a (cid:858)she(cid:859)