emit cell safe
ProvedResourceScheduling.Graph.emit_cell_safealgorithmspolynomial-time
The equality tests and unary resource-cell emission preserve the numeric bound; output length does not enter these primitive budgets.
Preamble
import Definitions.Def_ResourceScheduling_Graph_ReductionProgram import Definitions.Def_ResourceScheduling_Graph_RAMSafe open ResourceScheduling.Graph GraphReg GraphProgram
Formal statement
namespace ResourceScheduling.Graph
theorem emit_cell_safe (B : ℕ) (s : RAMState GraphReg) (hs : RAMBound B s) (hpos : 1 ≤ B) :
RAMSafe emitCell B s := by sorry
end ResourceScheduling.GraphSource
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.