Turing, A. M. On computable numbers, with an application to the Entscheidungsproblem, Proceedings of the London Mathematical Society, ser 2., vol. 42, 230-265; vol. 43, 544-546, (1936). Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
On the Length of Programs for Computing Finite Binary Sequences - Chaitin (1966) (86 citations) (Correct)
....the machine whose table of entries T N,M it then knows, until it finally calculates the finite binary sequence S which the program being imitated calculates, if S exists. 1.8.7a) has just been demonstrated. 1.8.7b) was shown in Section 1.6. The concept of a universal program is due to Turing [3]. The proof of (1.8.5) follows. From (1.8.7a) and (1.8.7b) 1 # k )LM (S k ) and from (1.8.7c) and the hypothesis of (1.8.5) LM (C(T LM (S k ) M ) r LM (S k ) It follows that LM (C(T LM (S k ) M ) 1 # k )LM (S k ) which is since the length of is (1 # k )LM (S k ....
Turing, A. M. On computable numbers, with an application to the Entscheidungsproblem. Proc. London Math. Soc. {2} 42 (1936--37), 230--265; Correction, ibid., 43 (1937), 544--546.
Polymorphic Time Systems for Estimating Program - Complexity Vincent Dornic (Correct)
No context found.
Turing, A. M. On computable numbers, with an application to the Entscheidungsproblem, Proceedings of the London Mathematical Society, ser 2., vol. 42, 230-265; vol. 43, 544-546, (1936).
Unknown - Eugene Eberbach Comp (Correct)
No context found.
Turing A., On Computable Numbers, with an Application to the Entscheidungsproblem, Proc. London Math. Soc., 42-2, 1936.
Fundamenta Informaticae 68 (2005) 47--102 47 IOS Press - Calculus Of Bounded (Correct)
No context found.
Turing A., On Computable Numbers, with an Application to the Entscheidungsproblem, Proc. of the London Mathematical Society, ser.2, vol.42 , 1936-37, 230-265; corrections, Ibid, vol.43, 1937, 544-546.
The Algebra of - Finite State Processes (Correct)
No context found.
A. M. Turing. On computable numbers, with an application to the entscheidungsproblem. Proceedings of the London Mathematical Society (second series), 42:230--265, 1937.
The Algebra of - Finite State Processes (Correct)
No context found.
A. M. Turing. On computable numbers, with an application to the entscheidungsproblem. Proceedings of the London Mathematical Society (second series), 42:230--265, 1937.
Termination Proofs for Systems Code - Ron Cook Microsoft (2006) (1 citation) (Correct)
No context found.
A. Turing. On computable numbers, with an application to the Entscheidungsproblem. London Mathematical Society, 42(2):230-- 265, 1936.
On the Computational Power of a Continuous-Space Optical.. - Naughton, Woods (Correct)
No context found.
A.M. Turing. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society ser. 2, 42(2):230-- 265, 1936.
Why don't we practice what we teach? Engineering Software.. - Oboler, Squire, Korb (2003) (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.
Nonuniform Hard Boolean Functions and Uniform Complexity Classes - Kabanets (2001) (Correct)
No context found.
A.M. Turing. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of London Mathematical Society, 2(42):230-265, 1936. A correction, ibid., 43:544-546, 1937.
The New AI: General & Sound & Relevant for Physics - Schmidhuber (2003) (Correct)
No context found.
A. M. Turing. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, Series 2, 41:230{ 267, 1936.
Model Checking Data-Independent Systems With Arrays - Newcomb (2003) (3 citations) (Correct)
No context found.
A.M. Turing. On computable numbers, with an application to the entscheidungsproblem. In Proceedings of the London Mathematical Society, volume 42, pages 230-265, 1937.
Combining Decision Procedures - Manna, Zarba (2003) (3 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.
Design of an Autonomous DNA Nanomechanical Device.. - Yin, Turberfield.. (Correct)
No context found.
A. M. Turing. On computable numbers, with an application to the entscheidungsproblem. In Proc. London Math. Society Ser. II, volume 43, pages 544--546, 1937.
Design of an Autonomous DNA Nanomechanical Device.. - Yin, Turberfield.. (Correct)
No context found.
A. M. Turing. On computable numbers, with an application to the entscheidungsproblem. In Proc. London Math. Society Ser. II, volume 42 of 2, pages 230--265, 1936.
On the Computational Power of a Continuous-Space Optical.. - Naughton, Woods (2001) (Correct)
No context found.
A.M. Turing. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society ser. 2, 42(2):230-- 265, 1936.
Some Parallel Algorithms for Integer Factorisation - Brent (1999) (5 citations) (Correct)
No context found.
A. M. Turing, On computable numbers, with an application to the Entscheidungsproblem, Proc. London Math. Soc. (2) 42 (
Gödel Machines: Self-Referential Universal Problem Solvers.. - Schmidhuber (2003) (Correct)
No context found.
A. M. Turing. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, Series 2, 41:230-267, 1936.
Decomposition of Preemptive Scheduling in the Go!.. - Greg Law Julie (2000) (Correct)
No context found.
A. M. Turing. On computable numbers, with an application to the entscheidungsproblem. Proceedings of the London Mathematical Society, Series 2(42):230-- 265, 1936-1937. 6
The Early Search for Tractable Ways of Reasoning About Programs - Jones (2003) (Correct)
No context found.
A. M. Turing. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, Series 2, 42:230--265, 1936. Correction published: ibid, 43:544--546, 1937.
On the Computational Power of a Continuous-Space Optical.. - Naughton, Woods (Correct)
No context found.
A.M. Turing. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society ser. 2, 42(2):230-- 265, 1936.
Some Parallel Algorithms for Integer Factorisation - Brent (1999) (5 citations) (Correct)
No context found.
A. M. Turing, On computable numbers, with an application to the Entscheidungsproblem, Proc. London Math. Soc. (2) 42 (
Trends in Software Verification - Holzmann (2003) (Correct)
No context found.
A.M. Turing, On computable numbers, with an application to the Entscheidungsproblem, Proc. London Mathematical Soc.,Ser.2-42, 1936, pp. 230-265.
On Expressiveness of Evolutionary Computation: Is EC Algorithmic? - Eberbach (2002) (Correct)
No context found.
Turing A., On Computable Numbers, with an Application to the Entscheidungsproblem, Proc. London Math. Soc., 42-2, 1936, 230-265.
A Minimum Encoding Approach to Document Clustering - Palin, Pasanen, Roos (Correct)
No context found.
Turing A.M., \On computable numbers, with an application to the Entscheidungsproblem", in Proc. London Mathematical Society 2, Nr. 42, pp. 230-265, 1936.
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