The Turing Trap: The Promise & Peril of Human-Like Artificial Intelligence Erik Brynjolfsson In 1950, Alan Turing proposed a test of whether a machine was intelligent: could a machine imitate a human …

Turing's proof demonstrated that undecidability is an intrinsic property of certain kinds of problems, revealing a boundary beyond which computation cannot go.

And in 1947 Turing gave what is perhaps the earliest public lecture on machine intelligence at the Royal Astronomical Society, London. Subsequently, in 1948, following a year's sabbatical at Cambridge, …

conditional criterion of intelligence to serve as a necessary condition. Turing's Test is defended against these objections, and French's claim that the test ought to be rejected because machines cannot …

The “review” is the book by Charles Petzold entitled The Annotated Turing: A Guided Tour through Alan Turing’s Historic Paper on Computability and the Turing Machine.

This parallels the case of artificial intelligence generally, where Turing’s test is still the best-known ‘criterion for “thinking”’—to use Turing’s own words— in machines. So, Einar Duenger Bohn’s …

Turing’s test doesn’t actually depend upon men and women being dis-cernibly different, but on a computer’s ability to be indistinguishable from a human in its responses’ (Schank, 1985, p. 6).