Proof of `Equivalence of Turing machines and word RAMs`
groundedproofs/Lax759944Proofs/TuringRamEquivalence.lean · lax-759944
What this proof establishes
no assumptions
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
The direct evaluator handles every instruction of the current RAM. In the other direction, the existing compiler is connected by a checked embedding.