word program correct
ProvedResourceScheduling.Graph.word_program_correctalgorithmspolynomial-time
The total word program equals the original reduceWord on valid and malformed inputs.
Preamble
import Definitions.Def_ResourceScheduling_Graph_WordProgram open CookPvsNP open ResourceScheduling.Graph
Formal statement
namespace ResourceScheduling.Graph theorem word_program_correct : wordProgram = reduceWord := by sorry end ResourceScheduling.Graph
Source
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.