Skip to Content

Universal Turing Machine

Posted on

Authors:

  • Xu, Jian
  • Zhang, Xingyuan
  • Urban, Christian
  • Joosten, Sebastiaan J. C.

Formal proof development

Published in: Archive of Formal Proofs

http://isa-afp.org/entries/Universal_Turing_Machine.html

Abstract:

We formalise results from computability theory: recursive functions, undecidability of the halting problem, and the existence of a universal Turing machine. This formalisation is the AFP entry corresponding to the paper Mechanising Turing Machines and Computability Theory in Isabelle/HOL, ITP 2013.

BibTeX entry:

@article{Xu19,
 abstract = {We formalise results from computability theory: recursive functions, undecidability of the halting problem, and the existence of a universal Turing machine. This formalisation is the AFP entry corresponding to the paper Mechanising Turing Machines and Computability Theory in Isabelle/HOL, ITP 2013.},
 author = {Jian Xu and Xingyuan Zhang and Christian Urban and Sebastiaan Jozef Christiaan Joosten},
 bdsk-url-1 = {http://isa-afp.org/entries/Universal%5C_Turing%5C_Machine.html},
 date-added = {2021-09-18 14:31:34 -0400},
 date-modified = {2021-09-18 14:31:34 -0400},
 issn = {2150-914x},
 journal = {Archive of Formal Proofs},
 month = {2},
 title = {Universal Turing Machine},
 url = {http://isa-afp.org/entries/Universal\_Turing\_Machine.html},
 year = {2019}
}