Verwandte Artikel zu Turing's Proof: Entscheidungsproblem , Undecidable...
Zu dieser ISBN ist aktuell kein Angebot verfügbar.
Inhaltsangabe
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"."
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Reseña del editor
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"."
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
- VerlagBetascript Publishing
- Erscheinungsdatum2010
- ISBN 10 6131142424
- ISBN 13 9786131142420
- EinbandTapa blanda
- SpracheEnglisch
- Anzahl der Seiten92
- HerausgeberSurhone Lambert M, Tennoe Mariam T, Henssonow Susan F
- Kontakt zum HerstellerNicht verfügbar
(Keine Angebote verfügbar)
Buch Finden: Kaufgesuch aufgebenSie finden Ihr gewünschtes Buch nicht? Wir suchen weiter für Sie. Sobald einer unserer Buchverkäufer das Buch bei AbeBooks anbietet, werden wir Sie informieren!
Kaufgesuch aufgeben