Universal Turing machine (English Wikipedia)

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

refsWebsite

Global rank English rank

2^nd place

741^st place

577^th place

6^th place

low place

102^nd place

76^th place

451^st place

277^th place

ams.org

Asperti & Ricciotti (2015). Asperti, Andrea; Ricciotti, Wilmer (2015). "A formalization of multi-tape Turing machines". Theoretical Computer Science. 603: 23–42. doi:10.1016/j.tcs.2015.07.013. hdl:11585/536349. MR 3406235.

In particular: Burks, Goldstine & von Neumann (1971) [1946]. Burks, Arthur W.; Goldstine, Herman H.; von Neumann, John (1971) [1946]. "Planning and Coding of the Problems for an Electronic Computing Instrument". In Bell, C. Gordon; Newell, Allen (eds.). Computer Structures: Readings and Examples. New York: McGraw-Hill Book Company. pp. 92–119. ISBN 0-07-004357-4.

From lecture transcript attributed to John von Neumann, as quoted by Copeland in Copeland & Fan (2023). Copeland, B. J.; Fan, Z. (2023). "Turing and Von Neumann: From Logic to the Computer". Philosophies. 8 (22): 22. doi:10.3390/philosophies8020022.
Rogozhin (1996). Rogozhin, Yurii (1996). "Small Universal Turing Machines". Theoretical Computer Science. 168 (2): 215–240. doi:10.1016/S0304-3975(96)00077-1.
Kudlek & Rogozhin (2002). Kudlek, Manfred; Rogozhin, Yurii (2002). "A universal Turing machine with 3 states and 9 symbols". In Kuich, Werner; Rozenberg, Grzegorz; Salomaa, Arto (eds.). Developments in Language Theory: 5th International Conference, DLT 2001 Wien, Austria, July 16–21, 2001, Revised Papers. Lecture Notes in Computer Science. Vol. 2295. Springer. pp. 311–318. doi:10.1007/3-540-46011-x_27. ISBN 978-3-540-43453-5.
Neary & Woods (2009). Neary, Turlough; Woods, Damien (2009). "Four Small Universal Turing Machines" (PDF). Fundamenta Informaticae. 91 (1): 123–144. doi:10.3233/FI-2009-0036.
Asperti & Ricciotti (2015). Asperti, Andrea; Ricciotti, Wilmer (2015). "A formalization of multi-tape Turing machines". Theoretical Computer Science. 603: 23–42. doi:10.1016/j.tcs.2015.07.013. hdl:11585/536349. MR 3406235.

Asperti & Ricciotti (2015). Asperti, Andrea; Ricciotti, Wilmer (2015). "A formalization of multi-tape Turing machines". Theoretical Computer Science. 603: 23–42. doi:10.1016/j.tcs.2015.07.013. hdl:11585/536349. MR 3406235.

Neary & Woods (2009). Neary, Turlough; Woods, Damien (2009). "Four Small Universal Turing Machines" (PDF). Fundamenta Informaticae. 91 (1): 123–144. doi:10.3233/FI-2009-0036.

Arora & Barak (2009), Theorem 1.9. Arora, Sanjeev; Barak, Boaz (2009). Complexity Theory: A Modern Approach. Cambridge University Press. ISBN 978-0-521-42426-4. section 1.4, "Machines as strings and the universal Turing machine" and 1.7, "Proof of theorem 1.9"
Arora & Barak (2009), Exercises 4.1. Arora, Sanjeev; Barak, Boaz (2009). Complexity Theory: A Modern Approach. Cambridge University Press. ISBN 978-0-521-42426-4. section 1.4, "Machines as strings and the universal Turing machine" and 1.7, "Proof of theorem 1.9"