Matches in DBpedia 2015-10 for { ?s ?p "Turing's proof is a proof by Alan Turing, first published in January 1937 with the title On Computable Numbers, With an Application to the Entscheidungsproblem. It was the second proof of the assertion (Alonzo Church's 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 ..."@en }
Showing triples 1 to 1 of
1
with 100 triples per page.
- Turings_proof comment "Turing's proof is a proof by Alan Turing, first published in January 1937 with the title On Computable Numbers, With an Application to the Entscheidungsproblem. It was the second proof of the assertion (Alonzo Church's 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 ...".