Formalizing Turing Machines

DOI10.1007/978-3-642-32621-9_1MaRDI QIDQ2915013zbMATH OpenOpenAlexFDO

Authors Andrea Asperti, Wilmer Ricciotti

Publication date 21 September 2012

Published in Logic, Language, Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32621-9_1

Mathematics Subject Classification ID

Turing machines and related notions (03D10)

Recommendations

• On Formalisms for Turing Machines
• scientific article; zbMATH DE number 1342250
• A formalization of multi-tape Turing machines
• Definability by turing machines
• Formalization of the class of problems solvable by a nondeterministic Turing machine
• Structured Turing machines
• Towards a formal theory of computability
• Mechanising Turing machines and computability theory in Isabelle/HOL
• Turing machines, transition systems, and interaction
• Turing machines, transition systems, and interaction

Cited in

(12)

• Weak call-by-value lambda calculus as a model of computation in Coq
• Call-by-value lambda calculus as a model of computation in Coq
• A Coinductive Animation of Turing Machines
• Incompleteness, Undecidability and Automated Proofs
• Reverse complexity
• Proof pearl: proving a simple von Neumann machine Turing complete
• scientific article; zbMATH DE number 3521955 (Why is no real title available?)
• Mechanising Turing machines and computability theory in Isabelle/HOL
• scientific article; zbMATH DE number 6302782 (Why is no real title available?)
• Definability by turing machines
• GOL in GOL in HOL: verified circuits in Conway's game of life
• A formalization of multi-tape Turing machines

Describes a project that uses

Uses Software

• Matita

This page was built for publication: Formalizing Turing Machines

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