Turing's Proof
Versandkostenfrei!
Versandfertig in 6-10 Tagen
23,99 €
inkl. MwSt.
PAYBACK Punkte
12 °P sammeln!
High Quality Content by WIKIPEDIA articles! First published in January 1937 with the title On Computable Numbers, With an Application to the Entscheidungsproblem, Turing's proof was the second proof of the assertion (Alonzo Church proof was first) that some decision problems are "undecidable": there is no single algorithm that infallibly gives a correct YES or NO answer to each instance of the problem. In his own words: "...what I shall prove is quite different from the well-known results of Gödel ... I shall now show that there is no general method which tells whether a given formula U is pr...
High Quality Content by WIKIPEDIA articles! First published in January 1937 with the title On Computable Numbers, With an Application to the Entscheidungsproblem, Turing's proof was the second proof of the assertion (Alonzo Church proof was first) that some decision problems are "undecidable": there is no single algorithm that infallibly gives a correct YES or NO answer to each instance of the problem. In his own words: "...what I shall prove is quite different from the well-known results of Gödel ... I shall now show that there is no general method which tells whether a given formula U is provable in K [Principia Mathematica]..." (Undecidable p. 145). Turing preceded this proof with two others. The second and third both rely on the first. All rely on his development of type-writer-like "computing machines" that obey a simple set of rules and his subsequent development of a "universal computing machine".
