Wir verwenden Cookies und Analyse-Tools, um die Nutzerfreundlichkeit der Internet-Seite zu verbessern und für Marketingzwecke. Wenn Sie fortfahren, diese Seite zu verwenden, nehmen wir an, dass Sie damit einverstanden sind. Zur Datenschutzerklärung.
Turing's Proof
CHF 42.80
Auf Lager
SKU
65UOCA4QMKS
1 Verfügbar 
Geliefert zwischen Do., 05.02.2026 und Fr., 06.02.2026
Details
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".
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786131142420
- Editor Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- EAN 9786131142420
- Format Fachbuch
- Titel Turing's Proof
- Herausgeber Betascript Publishing
- Anzahl Seiten 92
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
