Lax Lean Archive

While this submission is a draft, it cannot be used by other submissions.

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

groundedproofs/Lax434175Proofs/EncodingsEligibilityWords.lean · lax-434175

What this proof establishes

thm✓Lax434175.EncodingsEligibility (7th 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 writes the time D+1D + 1 on the machines outside the set of every job, and the threshold −1-1 when a set is empty, in polynomial time on the word RAM.