Environment v4.30.0. The archive's epoch is v4.33.0; only submissions in v4.30.0 can cite this work.
Proof of `Polynomial-time equivalence of Turing machines and word RAMs`
groundedproofs/Lax51Proofs/TuringRamPolytimeEquivalence.lean · lax-51
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
Polynomial-time machine invariance. A total function on finite words is computable in polynomial time by a finite multi-tape Turing machine if and only if it is computable in polynomial time by a uniform word RAM with a polynomially bounded sufficient word length.