Proof of `Machine sets encoded by long processing times` (12th statement)

groundedproofs/Lax434175Proofs/EncodingsEligibilityWords.lean · lax-434175

What this proof establishes

thm✓Lax434175.Propagation
thm✓Lax496464.WH_A4_MachineFacts
thm✓Lax496464.WH_A5_Bridges
thm✓Lax759944.TuringRamPolytimeEquivalence

thm✓Lax434175.EncodingsEligibility (12th statement)

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

The word map does not shorten the word and writes numbers polynomial in those it reads.