Turing machine (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Turing machine" in English language version.

Last modified: 21:50:35, 30 June 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

87doi.org

2^nd place

22jstor.org

23^rd place

15^th place

21ox.ac.uk

541^st place

356^th place

21semanticscholar.org

15^th place

8^th place

11wiktionary.org

1,064^th place

1,160^th place

11archive.org

6^th place

11princeton.edu

802^nd place

528^th place

11ams.org

434^th place

249^th place

11diccan.com

low place

11microsoft.com

263^rd place

259^th place

ams.org (Global: 434^th place; English: 249^th place)

mathscinet.ams.org

Grötschel, Lovász & Schrijver 1993, p. 32. Grötschel, Martin; Lovász, László; Schrijver, Alexander (1993). Geometric algorithms and combinatorial optimization. Algorithms and Combinatorics. Vol. 2 (2nd ed.). Berlin: Springer-Verlag. doi:10.1007/978-3-642-78240-4. ISBN 978-3-642-78242-8. MR 1261419.

archive.org (Global: 6^th place; English: 6^th place)

Cf. Post (1947), Boolos & Jeffrey (1999), Davis, Sigal & Weyuker (1994). Also see more at Post–Turing machine. Post, Emil (1947). "Recursive Unsolvability of a Problem of Thue". Journal of Symbolic Logic. 12: 1–11. doi:10.2307/2267170. JSTOR 2267170. Reprinted in Davis (2004, p. 293ff); appendix includes corrections and commentary on Turing's 1936–1937 paper. In particular see the footnotes 11 with corrections to the universal computing machine coding and footnote 14 with comments on Turing's first and second proofs. Boolos, George; Jeffrey, Richard (1999) [1974]. Computability and Logic (3rd ed.). Cambridge UK: Cambridge University Press. ISBN 0-521-20402-X. Davis, Martin; Sigal, Ron; Weyuker, Elaine J. (1994). Computability, Complexity, and Languages and Logic: Fundamentals of Theoretical Computer Science (2nd ed.). San Diego: Academic Press, Harcourt, Brace & Company. ISBN 0-12-206382-1.

diccan.com (Global: low place; English: low place)

Torres Quevedo 1915. Torres Quevedo, Leonardo (1915). "Essais sur l'Automatique – Sa définition. Étendue théorique de ses applications". Revue Générale des Sciences Pures et Appliquées (in French). 2: 601–611.

doi.org (Global: 2^nd place; English: 2^nd place)

Turing 1936, pp. 230–265. Turing, A. M. (1936). "On Computable Numbers, with an Application to the Entscheidungsproblem" (PDF). Proceedings of the London Mathematical Society. 2. 42 (published 1937): 230–265. doi:10.1112/plms/s2-42.1.230. S2CID 73712.
Turing (1968, pp. 3–4) Turing, Alan (1968) [1948]. "Intelligent Machinery". In Evans, C. R.; Robertson, A. D. J. (eds.). Cybernetics: Key Papers. Baltimore: University Park Press. p. 31. Reprint: Turing, A. M. (1996). "Intelligent Machinery, A Heretical Theory". Philosophia Mathematica. 4 (3): 256–260. doi:10.1093/philmat/4.3.256.
Cf. Post (1947), Boolos & Jeffrey (1999), Davis, Sigal & Weyuker (1994). Also see more at Post–Turing machine. Post, Emil (1947). "Recursive Unsolvability of a Problem of Thue". Journal of Symbolic Logic. 12: 1–11. doi:10.2307/2267170. JSTOR 2267170. Reprinted in Davis (2004, p. 293ff); appendix includes corrections and commentary on Turing's 1936–1937 paper. In particular see the footnotes 11 with corrections to the universal computing machine coding and footnote 14 with comments on Turing's first and second proofs. Boolos, George; Jeffrey, Richard (1999) [1974]. Computability and Logic (3rd ed.). Cambridge UK: Cambridge University Press. ISBN 0-521-20402-X. Davis, Martin; Sigal, Ron; Weyuker, Elaine J. (1994). Computability, Complexity, and Languages and Logic: Fundamentals of Theoretical Computer Science (2nd ed.). San Diego: Academic Press, Harcourt, Brace & Company. ISBN 0-12-206382-1.
Hennie & Stearns 1966. Hennie, F. C.; Stearns, R. E. (1966). "Two-tape simulation of multitape Turing machines". Journal of the ACM. 13 (4): 533–546. doi:10.1145/321356.321362.
Grötschel, Lovász & Schrijver 1993, p. 32. Grötschel, Martin; Lovász, László; Schrijver, Alexander (1993). Geometric algorithms and combinatorial optimization. Algorithms and Combinatorics. Vol. 2 (2nd ed.). Berlin: Springer-Verlag. doi:10.1007/978-3-642-78240-4. ISBN 978-3-642-78242-8. MR 1261419.
Dershowitz & Gurevich 2008. Dershowitz, Nachum; Gurevich, Yuri (September 2008). "A natural axiomatization of computability and proof of Church's Thesis" (PDF). Bulletin of Symbolic Logic. 14 (3): 299–350. doi:10.2178/bsl/1231081370. Retrieved 12 December 2025.
Post 1936. Post, Emil (1936). "Finite Combinatory Processes—Formulation 1". Journal of Symbolic Logic. 1: 103–105. doi:10.2307/2269031. JSTOR 2269031. Reprinted in Davis (2004, p. 289ff)

jstor.org (Global: 23^rd place; English: 15^th place)

Cf. Post (1947), Boolos & Jeffrey (1999), Davis, Sigal & Weyuker (1994). Also see more at Post–Turing machine. Post, Emil (1947). "Recursive Unsolvability of a Problem of Thue". Journal of Symbolic Logic. 12: 1–11. doi:10.2307/2267170. JSTOR 2267170. Reprinted in Davis (2004, p. 293ff); appendix includes corrections and commentary on Turing's 1936–1937 paper. In particular see the footnotes 11 with corrections to the universal computing machine coding and footnote 14 with comments on Turing's first and second proofs. Boolos, George; Jeffrey, Richard (1999) [1974]. Computability and Logic (3rd ed.). Cambridge UK: Cambridge University Press. ISBN 0-521-20402-X. Davis, Martin; Sigal, Ron; Weyuker, Elaine J. (1994). Computability, Complexity, and Languages and Logic: Fundamentals of Theoretical Computer Science (2nd ed.). San Diego: Academic Press, Harcourt, Brace & Company. ISBN 0-12-206382-1.
Post 1936. Post, Emil (1936). "Finite Combinatory Processes—Formulation 1". Journal of Symbolic Logic. 1: 103–105. doi:10.2307/2269031. JSTOR 2269031. Reprinted in Davis (2004, p. 289ff)

microsoft.com (Global: 263^rd place; English: 259^th place)

research.microsoft.com

Dershowitz & Gurevich 2008. Dershowitz, Nachum; Gurevich, Yuri (September 2008). "A natural axiomatization of computability and proof of Church's Thesis" (PDF). Bulletin of Symbolic Logic. 14 (3): 299–350. doi:10.2178/bsl/1231081370. Retrieved 12 December 2025.

ox.ac.uk (Global: 541^st place; English: 356^th place)

cs.ox.ac.uk

Turing 1936, pp. 230–265. Turing, A. M. (1936). "On Computable Numbers, with an Application to the Entscheidungsproblem" (PDF). Proceedings of the London Mathematical Society. 2. 42 (published 1937): 230–265. doi:10.1112/plms/s2-42.1.230. S2CID 73712.

princeton.edu (Global: 802^nd place; English: 528^th place)

cs.princeton.edu

Arora & Barak 2009, theorem 1.9. Arora, Sanjeev; Barak, Boaz (2009). "Sections 1.4 and 1.7". Complexity Theory: A Modern Approach. Cambridge University Press. ISBN 978-0-521-42426-4.

semanticscholar.org (Global: 15^th place; English: 8^th place)

api.semanticscholar.org

Turing 1936, pp. 230–265. Turing, A. M. (1936). "On Computable Numbers, with an Application to the Entscheidungsproblem" (PDF). Proceedings of the London Mathematical Society. 2. 42 (published 1937): 230–265. doi:10.1112/plms/s2-42.1.230. S2CID 73712.

wiktionary.org (Global: 1,064^th place; English: 1,160^th place)

en.wiktionary.org

See the definition of "innings" on Wiktionary

Turing machine (English Wikipedia)

ams.org (Global: 434th place; English: 249th place)

mathscinet.ams.org

archive.org (Global: 6th place; English: 6th place)

diccan.com (Global: low place; English: low place)

doi.org (Global: 2nd place; English: 2nd place)

jstor.org (Global: 23rd place; English: 15th place)

microsoft.com (Global: 263rd place; English: 259th place)