Mechanising Turing machines and computability theory in Isabelle/HOL

DOI10.1007/978-3-642-39634-2_13zbMATH Open1317.68237OpenAlexW50191166MaRDI QIDQ5327342FDOQ5327342

Authors: Jian Xu, Christian Urban, Xingyuan Zhang 

Publication date: 7 August 2013

Published in: Interactive Theorem Proving (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39634-2_13

Recommendations

• Mechanised computability theory
• Formalizing Turing Machines
• A formalization of multi-tape Turing machines
• A Coinductive Animation of Turing Machines
• Proof pearl: proving a simple von Neumann machine Turing complete

Mathematics Subject Classification ID

Cited In (17)

• Call-by-value lambda calculus as a model of computation in Coq
• Title not available (Why is that?)
• A mechanisation of computability theory in HOL
• Imperative process algebra and models of parallel computation
• Reverse complexity
• The DPRM Theorem in Isabelle (Short Paper).
• Using Isabelle/HOL to verify first-order relativity theory
• A formalization of multi-tape Turing machines
• A Coinductive Animation of Turing Machines
• Formalisation vs. understanding. A case study in Isabelle
• Incompleteness, Undecidability and Automated Proofs
• Mechanised computability theory
• Typing total recursive functions in Coq
• Proof pearl: proving a simple von Neumann machine Turing complete
• Formalizing Turing Machines
• Formalization of the computational theory of a Turing complete functional language model
• Weak call-by-value lambda calculus as a model of computation in Coq

Uses Software

• Isabelle/HOL

This page was built for publication: Mechanising Turing machines and computability theory in Isabelle/HOL

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5327342)