Cook–Levin machines: transition step block
ProvedCookLevin.machine_emit_transition_step_blockcomplexitycook-levinloopsturing-machines
Emit exactly the encoded transitionStep for a fixed state and scanned-symbol tuple, including its next-state consequence and every head and write clause.
Preamble
import Definitions.Def_CookLevin_Reduction import Definitions.Def_CookLevin_Complexity open CookLevin set_option autoImplicit false
Formal statement
theorem CookLevin.machine_emit_transition_step_block {k G : Nat} (hk : 8 ≤ k) (hG : 4 ≤ G)
(M : Machine) (tapes symbols q : Nat) (rs : List Symbol) :
∃ 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 → sh.Q = M.length → 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 := (encodeFormula (transitionStep sh M t q rs)).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 tapes + d tapes + e tapes) + B) + 4 * tapes)
(input ::
(contents (boolsToSymbols (List.replicate a true)), 1 + a) ::
(contents (boolsToSymbols (List.replicate b true)), 1 + b) ::
(contents (boolsToSymbols (List.replicate (c tapes) true)), 1 + c tapes) ::
(contents (boolsToSymbols (List.replicate (d tapes) true)), 1 + d tapes) ::
(contents (boolsToSymbols (List.replicate (e tapes) true)), 1 + e tapes) ::
(contents (boolsToSymbols (bits ++ chunk)), 1 + (bits ++ chunk).length) :: (fuel, 1) :: saved) := by sorrySource
Transition-clause emission for the Cook–Levin reduction.