Stream: Archive Mirror: Isabelle Users Mailing List

Topic: [isabelle] New in the AFP: Universal_Turing_Machine

Email Gateway (Aug 22 2022 at 19:09):

From: Lawrence Paulson <lp15@cam.ac.uk>
I’m happy to announce a substantial and impressive new entry covering the core of computation theory:

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.

You will find it online here:

https://www.isa-afp.org/entries/Universal_Turing_Machine.html

Many thanks to the authors for this entry!

Larry Paulson

Last updated: Nov 21 2024 at 12:39 UTC