Editing Universal Turing machine (section)

==References==
===Footnotes===
{{Reflist|15em}}
===Original paper and correction===
* {{cite journal |url=http://www.cs.virginia.edu/~robins/Turing_Paper_1936.pdf |title=On Computable Numbers, with an Application to the Entscheidungsproblem |date=1937 |journal=Proceedings of the London Mathematical Society |series=2 |volume=42 |issue=1 |last= Turing |first=A. M. |author-link=Alan Turing |pages=230–265 |doi=10.1112/plms/s2-42.1.230}}
* {{Cite journal |last=Turing |first=A. M. |date=1938 |title=On Computable Numbers, with an Application to the Entscheidungsproblem: A correction |periodical=Proceedings of the London Mathematical Society |series=2 |volume=43 |issue=6 |pages=544–6 |doi=10.1112/plms/s2-43.6.544}}

===Other works cited===
{{refbegin|indent=yes}}
* {{cite book |last1= Arora |first1= Sanjeev |last2= Barak |first2= Boaz |url= http://www.cs.princeton.edu/theory/complexity/ |title= Complexity Theory: A Modern Approach |publisher= Cambridge University Press |date= 2009 |isbn= 978-0-521-42426-4 |quote= section 1.4, "Machines as strings and the universal Turing machine" and 1.7, "Proof of theorem 1.9" }}
* {{cite journal
 | last1 = Asperti | first1 = Andrea
 | last2 = Ricciotti | first2 = Wilmer
 | doi = 10.1016/j.tcs.2015.07.013
 | journal = [[Theoretical Computer Science (journal)|Theoretical Computer Science]]
 | mr = 3406235
 | pages = 23–42
 | title = A formalization of multi-tape Turing machines
 | volume = 603
 | year = 2015| hdl = 11585/536349
 | hdl-access = free
 }}
* {{Cite book |last1=Burks |first1=Arthur W. |last2=Goldstine |first2=Herman H. |last3=von Neumann |first3=John |chapter=Planning and Coding of the Problems for an Electronic Computing Instrument |orig-year=1946 |pages=92–119 |editor-last1=Bell |editor-first1=C. Gordon |editor-last2=Newell |editor-first2=Allen |date=1971 |title=Computer Structures: Readings and Examples |publisher=McGraw-Hill Book Company |location=New York |isbn=0-07-004357-4 |chapter-url-access=registration |chapter-url=https://archive.org/details/computerstructur00bell/page/92}}
* {{Cite book |editor-last=Copeland |editor-first=Jack |editor-link=Jack Copeland  |title=The Essential Turing: Seminal Writings in Computing, Logic, Philosophy, Artificial Intelligence, and Artificial Life plus The Secrets of Enigma |year=2004 |place = Oxford UK |publisher=Oxford University Press |isbn=0-19-825079-7}}
* {{Cite journal |last1=Copeland |first1=B. J. |last2=Fan |first2=Z. |title=Turing and Von Neumann: From Logic to the Computer |journal=Philosophies |year=2023 |volume=8 |number=22 |page=22 |doi=10.3390/philosophies8020022|doi-access=free }}
* {{Cite book |first=Martin |last=Davis |author-link=Martin Davis (mathematician) |contribution=What is Computation? |editor-first=Lynn Arthur |editor-last=Steen |editor-link=Lynn Steen |title=Mathematics Today: Twelve Informal Essays |year =1980 |place=New York |publisher=Vintage Books (Random House) |isbn=978-0-394-74503-9 |url-access=registration |url=https://archive.org/details/mathematicstoday00stee}}
* {{Cite book |first=Martin |last=Davis  |title=Engines of Logic: Mathematicians and the origin of the Computer |edition=1st |year=2000 |place=New York |publisher=W. W. Norton & Company |isbn=0-393-32229-7}}
* {{Cite journal | last1 = Hennie | first1 = F. C. | last2 = Stearns | first2 = R. E. | doi = 10.1145/321356.321362 | title = Two-Tape Simulation of Multitape Turing Machines | journal = Journal of the ACM | volume = 13 | issue = 4 | pages = 533 | year = 1966 | s2cid = 2347143 }}
* {{Cite book |last=Knuth |first=Donald E. |author-link=Donald Knuth |title=The Art of Computer Programming |edition=second |volume=1: Fundamental Algorithms |publisher=Addison-Wesley Publishing Company |date=1973}} 
* {{Cite conference |first1=Manfred |last1=Kudlek |first2=Yurii |last2=Rogozhin |contribution=A universal Turing machine with 3 states and 9 symbols |title=Developments in Language Theory: 5th International Conference, DLT 2001 Wien, Austria, July 16–21, 2001, Revised Papers |editor1-first=Werner |editor1-last=Kuich |editor2-first=Grzegorz |editor2-last=Rozenberg |editor3-first=Arto |editor3-last=Salomaa |volume=2295 |publisher=Springer |year=2002 |pages=311–318 |doi=10.1007/3-540-46011-x_27 |series=Lecture Notes in Computer Science |isbn=978-3-540-43453-5}}
* {{Cite book |last=Minsky |first=Marvin Lee |title=Computation: Finite and Infinite Machines |year=1967 |publisher=Prentice Hall |isbn=978-0-13-165563-8}}
* {{Cite journal |first1=Turlough |last1=Neary |first2=Damien |last2=Woods |title=Four Small Universal Turing Machines |journal=Fundamenta Informaticae |volume=91 |issue=1 |year=2009 |pages=123–144 |doi=10.3233/FI-2009-0036 |url=http://mural.maynoothuniversity.ie/12416/1/Woods_FourSmall_2009.pdf}}
* {{Cite book |first1=Turlough |last1=Neary |first2=Damien |last2=Woods |contribution=Small Weakly Universal Turing Machines |title=17th International Symposium on Fundamentals of Computation Theory |title-link=International Symposium on Fundamentals of Computation Theory |pages=262–273 |publisher=Springer |series=Lecture Notes in Computer Science |volume= 5699 |year=2009b}}
* {{Cite book |first=Roger |last=Penrose |author-link=Roger Penrose |title=The Emperor's New Mind |year=1989 |place=Oxford UK |publisher=Oxford University Press | isbn=0-19-851973-7 |title-link=The Emperor's New Mind}}
* {{Cite journal |first=Yurii |last=Rogozhin |title=Small Universal Turing Machines |journal=Theoretical Computer Science |year=1996 |volume=168 |pages=215–240 |issue=2 |doi=10.1016/S0304-3975(96)00077-1 |doi-access=free}}
{{refend}}