Cook–Levin machines: link clauses for a complete time slice
ProvedCookLevin.machine_emit_link_time_blockcomplexitycook-levinloopsturing-machines
Emit all link clauses for every logical tape and position at one time. The fixed tape count determines the machine; the runtime width is supplied by reusable unary fuel. All three literal counters advance to the next time. Zero tape and alphabet bounds are included.
Preamble
import Definitions.Def_CookLevin_Tableau import Definitions.Def_CookLevin_Complexity open CookLevin set_option autoImplicit false
Formal statement
theorem CookLevin.machine_emit_link_time_block {k G : Nat} (hk : 6 ≤ k)
(hG : 4 ≤ G) (tapes symbols : Nat) :
∃ R : Machine, ∃ A B : Nat, TuringMachine k G R ∧
∀ (sh : Shape) (t : Nat) (input : Tape) (bits : List Bool)
(fuel : Nat → Symbol) (saved : List Tape),
sh.k = tapes → sh.G = symbols → saved.length + 6 = k →
fuel 0 ≠ oneSymbol →
(∀ i, i < sh.T + 1 → fuel (1 + i) = oneSymbol) →
fuel (1 + (sh.T + 1)) ≠ oneSymbol →
let a := fun t => literalN (.Neg (sh.headVar t 0 0))
let b := fun t => literalN (.Neg (sh.cellVar t 0 0 blankSymbol))
let c := fun t => literalN (.Pos (sh.readVar t 0 blankSymbol))
let chunk := (List.range sh.k).flatMap fun j =>
(List.range (sh.T + 1)).flatMap fun p =>
(encodeFormula ((List.range sh.G).map fun s =>
[Literal.Neg (sh.headVar t j p), Literal.Neg (sh.cellVar t j p s),
Literal.Pos (sh.readVar t j s)])).dropLast
Transforms R
(input :: (contents (boolsToSymbols (List.replicate (a t) true)), 1 + a t) ::
(contents (boolsToSymbols (List.replicate (b t) true)), 1 + b t) ::
(contents (boolsToSymbols (List.replicate (c t) true)), 1 + c t) ::
(contents (boolsToSymbols bits), 1 + bits.length) :: (fuel, 1) :: saved)
(tapes * ((sh.T + 1) * (A * (a (t + 1) + b (t + 1) + c (t + 1)) + B + 6) + 4 + (8 + 16 * symbols)))
(input :: (contents (boolsToSymbols (List.replicate (a (t + 1)) true)), 1 + a (t + 1)) ::
(contents (boolsToSymbols (List.replicate (b (t + 1)) true)), 1 + b (t + 1)) ::
(contents (boolsToSymbols (List.replicate (c (t + 1)) true)), 1 + c (t + 1)) ::
(contents (boolsToSymbols (bits ++ chunk)), 1 + (bits ++ chunk).length) ::
(fuel, 1) :: saved) := by sorrySource
Compose accepted literal emission, fixed counter increments, and reusable unary iteration with an exact output-prefix invariant.