Formalizing Turing Machines

DOI10.1007/978-3-642-32621-9_1zbMath1361.68183OpenAlexW129348609MaRDI QIDQ2915013

Wilmer Ricciotti, Andrea Asperti

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)

Related Items (6)

Reverse complexity ⋮ Weak call-by-value lambda calculus as a model of computation in Coq ⋮ A Coinductive Animation of Turing Machines ⋮ A formalization of multi-tape Turing machines ⋮ Incompleteness, Undecidability and Automated Proofs ⋮ Call-by-value lambda calculus as a model of computation in Coq

Uses Software

• Matita

This page was built for publication: Formalizing Turing Machines