On Computable Numbers with an Application to the Entscheidungsproblem
Edit Page
Report
Scan day: 05 March 2014 UTC
12
Virus safety - good
Description: Turing's paper which discusses the halting problem in the context of Gödel's Incompleteness Theorem. HTML.
On computable numbers (decision problem), A.M. Turing, 1936 - entry page at abelard.org WITH AN APPLICATION TO THE ENTSCHEIDUNGSPROBLEM Published on the abelard site by permission of the London Mathematical Society.
Size: 266 chars
Contact Information
Email: —
Phone&Fax: —
Address: —
Extended: —
WEBSITE Info
| Page title: | On computable numbers (decision problem), A.M. Turing, 1936 - entry page at abelard.org |
| Keywords: | decision problem, computable,numbers,Entscheidungsproblem,A.M. Turing,halting problem,stopping problem,CSS-2,Turing test,computer,artificial intelligence,teach,Alan Turing,mathematician,inventor,ciphers,cracking codes,Second World War,enigma,philosophy,Turing machine,halting problem,computability,neural nets,Godel,Gödel,Goedel,abelard, |
| Description: | On computable numbers, with an application to the Entscheidungsproblem (decision problem) by A.M. Turing - entry page at abelard.org |
| IP-address: | 216.92.71.201 |
WHOIS Info
| NS | Name Server:NS403.PAIR.COM Name Server:NS5.NS0.COM Name Server: Name Server: Name Server: Name Server: Name Server: Name Server: Name Server: Name Server: Name Server: |
| WHOIS | Status: ok |
| Date | Creation Date: 1998-02-27T05:00:00Z Expiry Date: 2017-02-26T05:00:00Z |