Universal Turing Machine
From MaRDI portal
- A formalisation of the Myhill-Nerode theorem based on regular expressions (proof pearl)
- Computability and Logic
- Finding models through graph saturation
- Finite combinatory processes—formulation
- Formalizing Turing Machines
- High-level separation logic for low-level code
- Unnamed Publication
- Mechanised computability theory
- Mechanising Turing machines and computability theory in Isabelle/HOL
- Mechanizing the metatheory of LF
- Undecidability and nonperiodicity for tilings of the plane
- Winskel is (almost) right: Towards a mechanized semantics textbook
This page was built for software: Universal Turing Machine
