stack specification budget
ProvedCookPvsNP.stack_specification_budgetalgorithmspolynomial-time
Increasing a certified source-execution budget preserves the semantic implementation certificate.
Preamble
import Definitions.Def_CookPvsNP_StackSpecification open CookPvsNP
Formal statement
namespace CookPvsNP
theorem stack_specification_budget {K A S : Type} (R : S → (K → List A) → Prop)
(p : StackProg K A) (f : S → S) (c d : S → ℕ)
(hp : StackImplements R p f c) (hd : ∀ s, c s ≤ d s) :
StackImplements R p f d := by sorry
end CookPvsNPSource
New auxiliary formalization for the ResourceScheduling Q2 reduction. The target is the unchanged CookPvsNP one-tape machine model, following Cook, The P versus NP problem, Clay Mathematics Institute (2000), Appendix. This explicit finite-column stack compiler and its simulation lemmas are new contributions, not numbered claims from Cook or the scheduling source paper.