Lax Lean Archive

Draft — mutable and not usable as a dependency; its citation marks the draft state.

Proof of `Equivalence of Turing machines and word RAMs`

groundedproofs/Lax51Proofs/TuringRamEquivalence.lean · lax-51

What this proof establishes

no assumptions

thm✓Lax51.TuringRamEquivalence

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

Description

Equivalence of Turing machines and word RAMs.