ram field frame
ProvedResourceScheduling.Graph.ram_field_framealgorithmspolynomial-time
A register program preserves each word field outside its syntactic input/output effect, including across loops.
Preamble
import Definitions.Def_ResourceScheduling_Graph_RAMFields open ResourceScheduling.Graph
Formal statement
namespace ResourceScheduling.Graph
theorem ram_field_frame {V : Type} [DecidableEq V] (p : RAMCode V) (b : Bool)
(h : p.effect b = false) (s : RAMState V) : (p.eval s).field b = s.field b := 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.