A Turing machine is a device which can respond via some communication medium (like a computer console) in a way that can convince a live human being that it (the machine) is human itself, or at least sentient. Put another way if you hold a conversation with computer and you're thinking to yourself, "Gee I'm sure I'm talking to a real human being." that computer has passed the Turing test and is a Turing machine. The concept is named for Alan Turing, a mid-20th Century mathematician and cryptologist.
| Attributes | Values |
|---|
| rdfs:label
| |
| rdfs:comment
| - A Turing machine is a device which can respond via some communication medium (like a computer console) in a way that can convince a live human being that it (the machine) is human itself, or at least sentient. Put another way if you hold a conversation with computer and you're thinking to yourself, "Gee I'm sure I'm talking to a real human being." that computer has passed the Turing test and is a Turing machine. The concept is named for Alan Turing, a mid-20th Century mathematician and cryptologist.
- A Turing machine is any of several machines designed and built by Alan Turing during the Second World War; they were made from old transistor radio components. The term is now, loosely, applied to any device that is incapable of predicting its own termination. All existing Turing machines are Turing-complete, since Turing himself supervised the construction of each machine. However, there are imitations of Turing machines (such as the Lambda Calculus®) which are not necessarily Turing-complete, and their manufacturers have to prove that their machines are complete enough to conform to the ISO Turing standard.
- A Turing machine is a theoretical device that manipulates symbols on a strip of tape according to a table of rules. Despite its simplicity, a Turing machine can be adapted to simulate the logic of any computer algorithm, and is particularly useful in explaining the functions of a CPU inside a computer.
|
| sameAs
| |
| dcterms:subject
| |
| dbkwik:uncyclopedi...iPageUsesTemplate
| |
| dbkwik:itlaw/prope...iPageUsesTemplate
| |
| abstract
| - A Turing machine is a device which can respond via some communication medium (like a computer console) in a way that can convince a live human being that it (the machine) is human itself, or at least sentient. Put another way if you hold a conversation with computer and you're thinking to yourself, "Gee I'm sure I'm talking to a real human being." that computer has passed the Turing test and is a Turing machine. The concept is named for Alan Turing, a mid-20th Century mathematician and cryptologist.
- A Turing machine is any of several machines designed and built by Alan Turing during the Second World War; they were made from old transistor radio components. The term is now, loosely, applied to any device that is incapable of predicting its own termination. All existing Turing machines are Turing-complete, since Turing himself supervised the construction of each machine. However, there are imitations of Turing machines (such as the Lambda Calculus®) which are not necessarily Turing-complete, and their manufacturers have to prove that their machines are complete enough to conform to the ISO Turing standard. Notable Turing machines include T-800, T-850, T-1000 and T-X. You may have already guessed what the T stands for.
- A Turing machine is a theoretical device that manipulates symbols on a strip of tape according to a table of rules. Despite its simplicity, a Turing machine can be adapted to simulate the logic of any computer algorithm, and is particularly useful in explaining the functions of a CPU inside a computer. The "Turing" machine was described by Alan Turing in 1936, which he called an "a(utomatic)-machine." The Turing machine was not intended as a practical computing technology, but rather as a thought experiment representing a computing machine. Turing machines help computer scientists understand the limits of mechanical computation.
|
![[RDF Data]](/fct/images/sw-rdf-blue.png)