Class Notes
(808,893)

United States
(313,366)

St. John's University
(801)

HON - HONORS
(67)

HON 1010C
(27)

Denis Sullivan
(22)

Lecture 20

#
HON 1010C Lecture 20: Allen Turing and the Turing Test
Premium

Unlock Document

St. John's University

HON - HONORS

HON 1010C

Denis Sullivan

Spring

Description

Philosophy 1010C Allen Turing Created contemporary logic system in which anything that can be deduced is deduced Algorithm Euclids Algorithm o Technique of finding the smallest common denominator between two numbers o 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 If remainder is 0, the remainder 2 is your common denominator Otherwise, the leftover is called Remainder 3, and you continue the process until you arrive at a remainder of 0. Turing Machine = a Universal Algorithm o A particular algorithm that can do everything any other algorithm can do o A mechanism for deriving any logical conclusion from some given set of premises o No debate about this machine essentially everyone agrees that it does what it says it does o The machine has a small lens (green boxes) which it uses to look at the track (black and white) o The machine has a finite number of internal states o The track is filled with only 1s and 0s and can be infinite o How it Works: 1. Depending on the internal state of the machine and whether there is a 1 or a 0 on the track, the machine will either halt or continue to operate 2. If it continues to operate, the internal state will either stay the same or change 3. It either changes the number on the track or leaves it the same 4. It moves one square to the left or one square to the right

More
Less
Related notes for HON 1010C