Alan M. Turing. On computable numbers, with an application to the entscheidungsproblem. Proceedings of the London Mathematical Society, 1936. 9  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
What Is an Algorithm? - Moschovakis (2001) (Correct)
....goal is to convince the reader that the problem of founding the theory of algorithms is important, and that it is ripe for solution. 2 Abstract Machines and Recursive Definitions 2. 1 Abstract Machines The best known model of mechanical computation is (still) the first, introduced by Turing [18], and after half a century of study, few doubt the truth of the fundamental Church Turing Thesis : A function f : N N on the natural numbers (or, more generally, on strings from a finite alphabet) is computable in principle exactly when it can be computed by a Turing Machine. The Church Turing ....
Alan Mathison Turing. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, 42:230--265, 1936--37.
On the Computational Power of Photosynthesis - Murphy, Woods, Naughton (2005) (Correct)
No context found.
Alan M. Turing. On computable numbers, with an application to the entscheidungsproblem. Proceedings of the London Mathematical Society, 1936. 9
Language Symbiosis through a Joint Abstract Grammar - Peeters (2003) (Correct)
No context found.
Alan Turing. On computable numbers, with an application to the entscheidungsproblem. In Proceedings of the London Mathematical Society, pages 230--265, 1936.
Building Safe Multi-Agent Applications by Formalising the - Deployment Environment.. (Correct)
No context found.
Alan Turing. On computable numbers, with an application to the entscheidungsproblem. In Proceedings of the London Mathematical Soceity, number 42 in 2, 1936.
The Combination Problem in Automated Reasoning - Zarba (2004) (Correct)
No context found.
Alan M. Turing. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, 42:230--265, 1936.
An Attempt to Automate NP-Hardness Reductions via SO∃ Logic - Nijjar (2004) (Correct)
No context found.
Alan M. Turing. On computable numbers, with an application to the entscheidungsproblem. In Proceedings, London Mathematical Society, volume 2, pages 230-- 265, 544--546, 1936.
To The Graduate School: - The Members Of (Correct)
No context found.
Alan Turing. On computable numbers, with an application to the Entscheidungsproblem. In Proceedings of the London Mathematical Society, Series 2, volume 42, pages 230--265, 1936.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC