Universal Turing Machine and Computability Theory in Isabelle/HOL
Lists
Only you see this
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
@inproceedings{xu2019universal,
author = {Jian Xu and Xingyuan Zhang and Christian Urban and Sebastiaan J. C. Joosten},
title = {{Universal Turing Machine and Computability Theory in Isabelle/HOL}},
booktitle = {University},
year = {2019},
}Loading related content...