Universal Turing Machine

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

8 February 2019

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.
BSD License

Topics

Theories

Cite

×
@article{Universal_Turing_Machine-AFP,
  author  = {Jian Xu, Xingyuan Zhang, Christian Urban and Sebastiaan J. C. Joosten},
  title   = {Universal Turing Machine},
  journal = {Archive of Formal Proofs},
  month   = February,
  year    = 2019,
  note    = {\url{http://isa-afp.org/entries/Universal_Turing_Machine.html},
            Formal proof development},
  ISSN    = {2150-914x},
}
Download