Read Turing’s original paper on AI (Turing, 1950). In the paper, he discusses se
ID: 2246755 • Letter: R
Question
Read Turing’s original paper on AI (Turing, 1950). In the paper, he discusses several objections to his proposed enterprise and his test for intelligence. Which objections still carry weight? Are his refutations valid? Can you think of new objections arising from develop- ments since he wrote the paper? In the paper, he predicts that, by the year 2000, a computer will have a 30% chance of passing a five-minute Turing Test with an unskilled interrogator. What chance do you think a computer would have today? In another 50 years?In preparing your response you must access the following three papers and use them in your argument and response:
1. Turing's article (Computing Machinery and Intelligence , A. M. Turing , Mind, Vol. 59, No. 236 (Oct., 1950), pp. 433-460) 2. Subcognition and the Limits of the Turing Test, Robert M. French, Mind, Vol 99, No. 393 (Jan., 1990), pp. 53-65) 3. The Turing Test: 50 Years later, Saygin et al Read Turing’s original paper on AI (Turing, 1950). In the paper, he discusses several objections to his proposed enterprise and his test for intelligence. Which objections still carry weight? Are his refutations valid? Can you think of new objections arising from develop- ments since he wrote the paper? In the paper, he predicts that, by the year 2000, a computer will have a 30% chance of passing a five-minute Turing Test with an unskilled interrogator. What chance do you think a computer would have today? In another 50 years?
In preparing your response you must access the following three papers and use them in your argument and response:
1. Turing's article (Computing Machinery and Intelligence , A. M. Turing , Mind, Vol. 59, No. 236 (Oct., 1950), pp. 433-460) 2. Subcognition and the Limits of the Turing Test, Robert M. French, Mind, Vol 99, No. 393 (Jan., 1990), pp. 53-65) 3. The Turing Test: 50 Years later, Saygin et al
In preparing your response you must access the following three papers and use them in your argument and response:
1. Turing's article (Computing Machinery and Intelligence , A. M. Turing , Mind, Vol. 59, No. 236 (Oct., 1950), pp. 433-460) 2. Subcognition and the Limits of the Turing Test, Robert M. French, Mind, Vol 99, No. 393 (Jan., 1990), pp. 53-65) 3. The Turing Test: 50 Years later, Saygin et al In preparing your response you must access the following three papers and use them in your argument and response:
1. Turing's article (Computing Machinery and Intelligence , A. M. Turing , Mind, Vol. 59, No. 236 (Oct., 1950), pp. 433-460) 2. Subcognition and the Limits of the Turing Test, Robert M. French, Mind, Vol 99, No. 393 (Jan., 1990), pp. 53-65) 3. The Turing Test: 50 Years later, Saygin et al
Explanation / Answer
A Turing machine is a mathematical model of computation that defines an abstract machine which manipulates symbols on a strip of tape according to a table of rules. Despite the model's simplicity, given any computer algorithm, a Turing machine can be constructed that is capable of simulating that algorithm's logic.
The machine operates on an infinite memory tape divided into discrete cells.The machine positions its head over a cell and "reads" (scans) the symbol there. Then, as per the symbol and its present place in a finite table of user-specified instructions, the machine
(i) writes a symbol (e.g. a digit or a letter from a finite alphabet) in the cell (some models allowing symbol erasure or no writing), then
(ii) either moves the tape one cell left or right (some models allow no motion, some models move the head), then
(iii) (as determined by the observed symbol and the machine's place in the table) either proceeds to a subsequent instruction or halts the computation.
The Turing machine was invented in 1936 by Alan Turing, who called it an a-machine (automatic machine). With this model, Turing was able to answer two questions in the negative: (1) Does a machine exist that can determine whether any arbitrary machine on its tape is "circular" (e.g. freezes, or fails to continue its computational task); similarly, (2) does a machine exist that can determine whether any arbitrary machine on its tape ever prints a given symbol.Thus by providing a mathematical description of a very simple device capable of arbitrary computations, he was able to prove properties of computation in general—and in particular, the uncomputability of the Entscheidungsproblem ("decision problem").
Thus, Turing machines prove fundamental limitations on the power of mechanical computation. While they can express arbitrary computations, their minimalistic design makes them unsuitable for computation in practice: real-world computers are based on different designs that, unlike Turing machines, use random-access memory.
Turing completeness is the ability for a system of instructions to simulate a Turing machine. A programming language that is Turing complete is theoretically capable of expressing all tasks accomplishable by computers; nearly all programming languages are Turing complete if the limitations of finite memory are ignored.
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.