A polynomial-time multistack computation with finite output has a finite work-alphabet realization
ProvedPvsNP.finite_work_realizationcomputational-complexityreductionsturing-machines
A finite-control TM2 program can introduce only finitely many work symbols, even when its supplied stack types are infinite. Finite input and output ports are preserved, and restricting all other stacks gives another realization with the same transition count.
Preamble
import Definitions.Def_PvsNPFrontier
Formal statement
theorem PvsNP.finite_work_realization {α β U V : Type} [Finite V]
{ei : α → List U} {eo : β → List V} {f : α → β}
(p : Turing.TM2ComputableInPolyTime ei eo f) : PvsNP.FinitePolyTime ei eo f := by
sorry
Source
Cook, The complexity of theorem-proving procedures (STOC 1971). Mathlib Computability.TuringMachine.Computable. The finite-stack model and pair conventions are formalized in the Prove2Me PvsNP and OAI.MetricKMedian comparator definitions.