01:830:305 Lecture Notes - Lecture 2: Turing Test, Computer Language, Punched Tape
20 Apr 2016
School
Department
Course
Professor
Document Summary
Alan turing: a turing machine gets input symbols on an infinite paper tape, and writes output symbols on the same tape, an algorithm is a concrete procedure to solve a particular problem (that is give a particular output of each, anything you can make an algorithm for a turing machine can do, he began to think anything can become an algorithm so turing machine can do anything. You are the judge and there is a person on the other side and they are trying to be the opposite gender: can a women pretend to be a man, you are judge and then mystery entity (could be a person of a computer, computer has been programmed to be a person. can you tell, would that count or be good enough, you send texts to them and they send texts back to you (1935 over computer, intelligence is a type of behavior.
