Cook–Levin machines: complete cell-constraint formula from a work bank
ProvedCookLevin.machine_cell_clause_emitter_from_bankcomplexitycook-levinloopsturing-machines
For fixed tape and symbol bounds, a well-formed machine emits the full actual cellClauses formula from two unary fuel tapes following an arbitrary work bank, with two blank tapes for counter and output. All work heads begin at zero. For n=T+1 and v=8symbols(T+2)tapesn the time is n*(tapes*(n*(Av+B+6)+4+8symbols)+3)+6. The position marker is explicitly non-one. Input and the existing bank are preserved; canonical encoded formula is on the last tape.
Preamble
import Definitions.Def_CookLevin_Tableau import Definitions.Def_CookLevin_Complexity open CookLevin set_option autoImplicit false
Formal statement
theorem CookLevin.machine_cell_clause_emitter_from_bank {a G : Nat} (hG : 4 ≤ G)
(tapes symbols : Nat) :
∃ R : Machine, ∃ A B : Nat, TuringMachine (a + 5) G R ∧
∀ (sh : Shape) (input : Tape) (times positions : Nat → Symbol) (saved : List Tape),
sh.k = tapes → sh.G = symbols → saved.length = a →
positions 0 ≠ oneSymbol →
(∀ i, i < sh.T + 1 → positions (1 + i) = oneSymbol) →
positions (1 + (sh.T + 1)) ≠ oneSymbol →
(∀ i, i < sh.T + 1 → times (1 + i) = oneSymbol) →
times (1 + (sh.T + 1)) ≠ oneSymbol →
let n := sh.T + 1
let v := 8 * symbols * sh.P * tapes * n
let output := encodeFormula (cellClauses sh)
Transforms R
(input :: (saved ++ [(times, 0), (positions, 0), (contents [], 0), (contents [], 0)]))
(n * (tapes * (n * (A * v + B + 6) + 4 + 8 * symbols) + 3) + 6)
(input :: (saved ++ [(times, 1 + n), (positions, 1),
(contents (boolsToSymbols (List.replicate v true)), 1 + v),
(contents (boolsToSymbols output), 1 + output.length)])) := by sorrySource
Initialize four heads, run the accepted complete cell emitter, and apply a tape permutation preserving the input index and runtime.