Cook–Levin machines: transition tapes block
ProvedCookLevin.machine_emit_transition_tapes_blockcomplexitycook-levinloopsturing-machines
Emit guarded transition position clauses across a fixed number of tapes, preserving the width fuel and advancing the three position counters. The bound is explicit in width and final counter values.
Preamble
import Definitions.Def_CookLevin_Reduction import Definitions.Def_CookLevin_Complexity open CookLevin set_option autoImplicit false
Formal statement
theorem CookLevin.machine_emit_transition_tapes_block {k G : Nat} (hk : 8 ≤ k) (hG : 4 ≤ G)
(tapes symbols q count : Nat) (rs : List Symbol) (actions : Nat → Action) :
∃ 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 + 8 = k →
fuel 0 ≠ oneSymbol →
(∀ i, i < sh.T → fuel (1 + i) = oneSymbol) →
fuel (1 + sh.T) ≠ oneSymbol →
let a := literalN (.Neg (sh.stateVar t 0))
let b := literalN (.Neg (sh.readVar t 0 0))
let c := fun j => literalN (.Neg (sh.headVar t j 0))
let d := fun j => literalN (.Pos (sh.headVar (t + 1) j 0))
let e := fun j => literalN (.Pos (sh.cellVar (t + 1) j 0 blankSymbol))
let chunk := (List.range count).flatMap fun j => (List.range (sh.T + 1)).flatMap fun p =>
(encodeFormula
[guardClause sh t q rs ++ [Literal.Neg (sh.headVar t j p),
Literal.Pos (sh.headVar (t + 1) j (movePos (actions j).2 p))],
guardClause sh t q rs ++ [Literal.Neg (sh.headVar t j p),
Literal.Pos (sh.cellVar (t + 1) j p (actions j).1)]]).dropLast
Transforms R
(input ::
(contents (boolsToSymbols (List.replicate a true)), 1 + a) ::
(contents (boolsToSymbols (List.replicate b true)), 1 + b) ::
(contents (boolsToSymbols (List.replicate (c 0) true)), 1 + c 0) ::
(contents (boolsToSymbols (List.replicate (d 0) true)), 1 + d 0) ::
(contents (boolsToSymbols (List.replicate (e 0) true)), 1 + e 0) ::
(contents (boolsToSymbols bits), 1 + bits.length) :: (fuel, 1) :: saved)
((sh.T + 1) * (A * (a + b + c count + d count + e count) + B) + 4 * count)
(input ::
(contents (boolsToSymbols (List.replicate a true)), 1 + a) ::
(contents (boolsToSymbols (List.replicate b true)), 1 + b) ::
(contents (boolsToSymbols (List.replicate (c count) true)), 1 + c count) ::
(contents (boolsToSymbols (List.replicate (d count) true)), 1 + d count) ::
(contents (boolsToSymbols (List.replicate (e count) true)), 1 + e count) ::
(contents (boolsToSymbols (bits ++ chunk)), 1 + (bits ++ chunk).length) :: (fuel, 1) :: saved) := by sorrySource
Transition-clause emission for the Cook–Levin reduction.