Synopsis
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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"."
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Présentation de l'éditeur
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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"."
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Résultats de recherche pour Turing's Proof: Entscheidungsproblem , Undecidable...
Image fournie par le vendeur
Turing's Proof
impression à la demandeVendeur : preigu, Osnabrück, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Turing's Proof | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | Betascript Publishing | EAN 9786131142420 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand. N° de réf. du vendeur 113277038
Acheter neuf
EUR 31,80
EUR 70 shipping
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 5 disponible(s)