Turing, A. M., 1936. On computable numbers with an application to the entscheidungsproblem, Proc. London Math. Soc. Ser. 2, 42, 230-265. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Turing Machines, Transition Systems, and Interaction - Goldin, Smolka, al. (2004) (1 citation) Self-citation (Turing) (Correct)
No context found.
A. M. Turing. On computable numbers with an application to the Entscheidungsproblem. Proc. London Math Society, 2(4):230-265, 1936. Reprinted in Martin Davis, Ed., The Undecidable (New York: Raven, 1965), pp. 116-151.
A Model for Deliberation, Action, and Introspection - Doyle (1980) (1 citation) (Correct)
No context found.
Turing, A. M., 1936. On computable numbers with an application to the entscheidungsproblem, Proc. London Math. Soc. Ser. 2, 42, 230-265.
Interactive Algorithms 2005 - With Added Appendix (Correct)
No context found.
A. M. Turing. "On Computable Numbers, with an Application to the Entscheidungsproblem ", Proceedings of London Mathematical Society, series 2, vol. 42, 1936, pp. 230--265; correction, ibidem, vol. 43, pp. 544--546.
USENIX Association - Th Usenix Security (1992) (2 citations) (Correct)
No context found.
A.M Turing. On computable numbers: With an application to the entscheidungsproblem. Proceedings of the London Mathematical Society, 42:230-- 265, 1936.
Unknown - Incomd Sciencecolum By (Correct)
No context found.
Turing 1936 Alan Turing, "On computable numbers, with an application to the Entscheidungsproblem", Proc. of London MonoDDp-Do.
Stochastic Context-Free Grammars - Mark Andrews Th (Correct)
No context found.
Turing, A. (1936), `On computable numbers, with an application to the entscheidungsproblem', Proceedings of the London Mathematical Society 42, 230--265.
Language Learning and Nonlinear Dynamical Systems - Andrews (2003) (Correct)
No context found.
Turing, A. (1936), `On computable numbers, with an application to the entscheidungsproblem ', Proceedings of the London Mathematical Society 42, 230--265.
Interaction as a Framework for Modeling - Peter Wegner And (14 citations) (Correct)
No context found.
Alan Turing, On Computable Numbers with an Application to the Entscheidungsproblem, Proc. London Math Soc., 2:42, pp. 230-265, 1936.
Coinductive Models of Finite Computing Agents - Wegner, Goldin (1999) (7 citations) (Correct)
No context found.
Alan Turing. On Computable Numbers with an Application to the Entscheidungsproblem. Proc. London Math Society, 2:42, pp. 230-265, 1936.
June 14, 2001 17:51 WSPC/bk01-001-hseke chap01 - Computer Language Advances (Correct)
No context found.
A. Turing, "On computable numbers, with an application to the Entscheidungs problem", Proceedings of the London Mathematical Society 2, no. 42, 230--265.
D. E. Cooke, M. Gelfond J. E. Urban - The Fact That (Correct)
No context found.
A. Turing, "On computable numbers, with an application to the Entscheidungs problem", Proceedings of the London Mathematical Society 2, no. 42, 230--265.
The Paradox of Overfitting - Volker Nannen April (Correct)
No context found.
Alan M. Turing. On computable numbers with an application to the Entscheidungsproblem. Proc. London Math. Soc., Ser. 2, 42:230-- 265, 1936.
Inaccessibility And Undecidability In Computation, Geometry.. - Saito, Kaneko (2001) (Correct)
No context found.
A.M. Turing, On computable numbers with an application to the Entscheidungsproblem, Proc. London Math. Soc. 42 (1936) 230.
Reliable Identification of Bounded-length Viruses is NP-complete - Spinellis (2003) (3 citations) (Correct)
No context found.
Alan M. Turing, "On computable numbers, with an application to the Entscheidungs Problem," Proceedings of the London Mathematical Society, vol. 2, no. 42, pp. 230--265, 1936, Corrections in 2(43):544--546.
FMC: An Approach towards Architecture-Centric System Development - Keller, Wendt (2003) (Correct)
No context found.
A.M. Turing "On Computable Numbers, with an Application to the Entscheidungsproblem", Proceedings of the London Mathematical Society, vol. 42, 1936.
Computability Classes for Enforcement Mechanisms - Hamlen, Morrisett, Schneider (2003) (8 citations) (Correct)
No context found.
A. M. Turing. On computable numbers with an application to the Entscheidungs-problem. In Proceedings of the London Mathematical Society, volume 2, pages 42, 230--265, 1936.
Emergent Evolutionary Dynamics of Self-Reproducing Cellular.. - Salzberg (2003) (Correct)
No context found.
A. M. Turing. On computable numbers with an application to the entscheidungsproblem. Proc. London Math. Soc. Ser., 42:230--265, 1936.
Ordinary Interactive Small-Step Algorithms, I - Andreas Blass Yuri (2004) (Correct)
No context found.
Alan M. Turing, "On computable numbers, with an application to the Entscheidungsproblem", Proceedings of London Mathematical Society, series 2, vol. 42 (1936--1937), 230--265; correction, ibid., vol. 43, 544-- 546. Available online at http://www.abelard.org/turpap2/tp2-ie.asp.
Computability Classes for Enforcement Mechanisms - Hamlen, Morrisett, Schneider (2003) (8 citations) (Correct)
No context found.
A. M. Turing. On computable numbers with an application to the Entscheidungs-problem. In Proceedings of the London Mathematical Society, volume 2, pages 42, 230--265, 1936.
Information Assurance Capacity Building: A Case Study - Falby, al. (2003) (Correct)
No context found.
Turing, A. M. On Computable Numbers with an Application to the Entscheidungaproblem. Proceedings of the London Mathematical Society, series 2, 42, pp. 230265, 1936.
Trivial Reals - Downey, Hirschfeldt, Nies, Stephan (2002) (3 citations) (Correct)
No context found.
Turing, A., On computable numbers with an application to the Entscheidungsproblem, Proceedings of the London Mathematical Society 42 (1936), 230--265, correction in Proceedings of the London Mathematical Society 43 (1937), 544-- 546.
Computably Enumerable Reals and Uniformly Presentable Ideals - Downey, Terwijn (2002) (Correct)
No context found.
Turing, A., On computable numbers with an application to the Entscheidungsproblem, Proc. Amer. Math. Soc. 43 (1937) 544-546.
Minimum Description Length Induction, Bayesianism and.. - Vitányi, Li (2000) (Correct)
No context found.
A. M. Turing, "On computable numbers with an application to the Entscheidungsproblem, Correction," Proc. London Math. Soc, ser. 2, vol. 43, pp. 544--546, 1937.
Minimum Description Length Induction, Bayesianism and.. - Vitányi, Li (2000) (Correct)
No context found.
A. M. Turing, "On computable numbers with an application to the Entscheidungsproblem," Proc. London Math. Soc., ser. 2, vol. 42, pp. 230--265, 1936.
Incompleteness, Complexity, Randomness and Beyond - Calude (2002) (Correct)
No context found.
A. M. Turing. On computable numbers with an application to the Entscheidungsproblem, Proc. Amer. Math. Soc. 42 (
First 50 documents Next 50
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