Search results
Results From The WOW.Com Content Network
(This is the essential insight of the Church–Turing thesis and the universal Turing machine.) Therefore, if any digital machine can "act like it is thinking", then every sufficiently powerful digital machine can. Turing writes, "all digital computers are in a sense equivalent." [15] This allows the original question to be made even more specific.
The Turing test, originally called the imitation game by Alan Turing in 1949, [2] is a test of a machine's ability to exhibit intelligent behaviour equivalent to that of a human. In the test, a human evaluator judges a text transcript of a natural-language conversation between a human and a machine.
Alan Turing [15] reduced the problem of defining intelligence to a simple question about conversation. He suggests that: if a machine can answer any question posed to it, using the same words that an ordinary person would, then we may call that machine intelligent.
The response, suggested by Alan Turing's essay "Can Machines Think?", is that if a program is a convincing imitation of an intelligent being, it is in fact intelligent. The dispute is thus over what it means for a program to have "real" intelligence, and by what signs it can be detected.
Alan Turing was driven to a terrible despair and early death by the nation he'd done so much to save. This remains a shame on the British government and British history. A pardon can go some way to healing this damage. It may act as an apology to many of the other gay men, not as well-known as Alan Turing, who were subjected to these laws. [193]
The Chinese room implements a version of the Turing test. [49] Alan Turing introduced the test in 1950 to help answer the question "can machines think?" In the standard version, a human judge engages in a natural language conversation with a human and a machine designed to generate performance indistinguishable from that of a human being.
The Turing machine was invented in 1936 by Alan Turing, [7] [8] who called it an "a-machine" (automatic machine). [9] It was Turing's doctoral advisor, Alonzo Church, who later coined the term "Turing machine" in a review. [10] With this model, Turing was able to answer two questions in the negative:
In computer science, a universal Turing machine (UTM) is a Turing machine capable of computing any computable sequence, [1] as described by Alan Turing in his seminal paper "On Computable Numbers, with an Application to the Entscheidungsproblem". Common sense might say that a universal machine is impossible, but Turing proves that it is possible.