Alan Turing: Machine
Alan Turing was British mathematician, logician, cryptanalyst, and computer scientist. Explore interesting quotes on machine.“These questions replace our original, "Can machines think?"”
Computing Machinery and Intelligence (1950)
Context: "Can machines think?"... The new form of the problem can be described in terms of a game which we call the 'imitation game." It is played with three people, a man (A), a woman (B), and an interrogator (C) who may be of either sex. The interrogator stays in a room apart front the other two. The object of the game for the interrogator is to determine which of the other two is the man and which is the woman. He knows them by labels X and Y, and at the end of the game he says either "X is A and Y is B" or "X is B and Y is A." The interrogator is allowed to put questions to A and B... We now ask the question, "What will happen when a machine takes the part of A in this game?" Will the interrogator decide wrongly as often when the game is played like this as he does when the game is played between a man and a woman? These questions replace our original, "Can machines think?"
Source: Computing Machinery and Intelligence (1950), p. 442.
Source: Computing machinery and intelligence
“Machines take me by surprise with great frequency.”
Source: Computing Machinery and Intelligence (1950), p. 450.
Source: Computing Machinery and Intelligence (1950), p. 451.
Context: The view that machines cannot give rise to surprises is due, I believe, to a fallacy to which philosophers and mathematicians are particularly subject. This is the assumption that as soon as a fact is presented to a mind all consequences of that fact spring into the mind simultaneously with it. It is a very useful assumption under many circumstances, but one too easily forgets that it is false. A natural consequence of doing so is that one then assumes that there is no virtue in the mere working out of consequences from data and general principles.
Source: Mechanical Intelligence: Collected Works of A.M. Turing
"Proposed Electronic Calculator" (1946), a report for National Physical Laboratory, Teddington; published in A. M. Turing's ACE Report of 1946 and Other Papers (1986), edited by B. E. Carpenter and R. W. Doran, and in The Collected Works of A. M. Turing (1992), edited by D. C. Ince, Vol. 3.
"Intelligent Machinery: A Report by A. M. Turing," (Summer 1948), submitted to the National Physical Laboratory (1948) and published in Key Papers: Cybernetics, ed. C. R. Evans and A. D. J. Robertson (1968) and, in variant form, in Machine Intelligence 5, ed. B. Meltzer and D. Michie (1969).
Computing Machinery and Intelligence (1950)
Computing Machinery and Intelligence (1950)
Computing Machinery and Intelligence (1950)
Source: Computing Machinery and Intelligence (1950), p. 436.
Computing Machinery and Intelligence (1950)
On Computable Numbers, with an Application to the Entscheidungsproblem (1936)
On Computable Numbers, with an Application to the Entscheidungsproblem (1936)
On Computable Numbers, with an Application to the Entscheidungsproblem (1936)
“The "scanned symbol" is the only one of which the machine is... "directly aware."”
However, by altering its m-configuration the machine can effectively remember some of the symbols which it has "seen" (scanned) previously.
On Computable Numbers, with an Application to the Entscheidungsproblem (1936)
On Computable Numbers, with an Application to the Entscheidungsproblem (1936)
On Computable Numbers, with an Application to the Entscheidungsproblem (1936)