The following pages link to Formalizing Turing Machines (Q2915013):
Displaying 6 items.
- Reverse complexity (Q287279) (← links)
- A formalization of multi-tape Turing machines (Q744986) (← links)
- Weak call-by-value lambda calculus as a model of computation in Coq (Q1687735) (← links)
- Call-by-value lambda calculus as a model of computation in Coq (Q2319993) (← links)
- A Coinductive Animation of Turing Machines (Q2797865) (← links)
- Incompleteness, Undecidability and Automated Proofs (Q2829997) (← links)