OAI/Computability/UniqueGames/Machines/PoweringInitializeFrame.lean
19 declarations, 0 contain sorry, 0 declared as axioms
- def
OAI.UniqueGamesTheorem.Foundations.Complexity.PoweringInitializeFrame.initialExtraline 12Source documentation
The extra tapes initially contain only the live serialized table.
def initialExtra (graph : PortTables.Table vertices d) (n : Nat) : PoweringMachineInitialize.ExtraTape (PoweringMachineRowBody.capacity n) → List Bool := …Mentions: OAI.UniqueGamesTheorem.Foundations.Complexity.PoweringMachineInitialize.ExtraTape, OAI.UniqueGamesTheorem.Foundations.Complexity.PoweringMachineRowBody.capacity
- theorem
OAI.UniqueGamesTheorem.Foundations.Complexity.PoweringInitializeFrame.initialExtra_tableline 17 - theorem
OAI.UniqueGamesTheorem.Foundations.Complexity.PoweringInitializeFrame.initialExtra_otherline 21 - theorem
OAI.UniqueGamesTheorem.Foundations.Complexity.PoweringInitializeFrame.initialExtra_scratchline 26 - def
OAI.UniqueGamesTheorem.Foundations.Complexity.PoweringInitializeFrame.preparedTapesline 32Source documentation
Exact frame left by initialization, including the preserved input table.
def preparedTapes (graph : PortTables.Table vertices d) (n : Nat) : PoweringMachineGlobal.Tape n → List Bool := …Mentions: OAI.UniqueGamesTheorem.Foundations.Complexity.PoweringMachineGlobal.Tape
- theorem
OAI.UniqueGamesTheorem.Foundations.Complexity.PoweringInitializeFrame.prepared_commonRoleline 38 - theorem
OAI.UniqueGamesTheorem.Foundations.Complexity.PoweringInitializeFrame.prepared_readyline 46 - theorem
OAI.UniqueGamesTheorem.Foundations.Complexity.PoweringInitializeFrame.prepared_startline 56 - theorem
OAI.UniqueGamesTheorem.Foundations.Complexity.PoweringInitializeFrame.prepared_counterline 64Source documentation
Installing the outer-loop counter changes nothing: it is already present.
theorem prepared_counter (graph : PortTables.Table vertices d) (n : Nat) : PoweringMachineOuterLoop.counter (PoweringMachineGlobal.placement n) (preparedTapes graph n) vertices = preparedTapes graph n := by …Mentions: OAI.UniqueGamesTheorem.Foundations.Complexity.PoweringMachineOuterLoop.counter, OAI.UniqueGamesTheorem.Foundations.Complexity.PoweringMachineGlobal.placement, OAI.UniqueGamesTheorem.Foundations.Complexity.PoweringInitializeFrame.preparedTapes
- theorem
OAI.UniqueGamesTheorem.Foundations.Complexity.PoweringInitializeFrame.prepared_outputline 71 - theorem
OAI.UniqueGamesTheorem.Foundations.Complexity.PoweringInitializeFrame.prepared_verticesline 76 - theorem
OAI.UniqueGamesTheorem.Foundations.Complexity.PoweringInitializeFrame.prepared_dartsline 79 - theorem
OAI.UniqueGamesTheorem.Foundations.Complexity.PoweringInitializeFrame.prepared_sourceline 83 - def
OAI.UniqueGamesTheorem.Foundations.Complexity.PoweringInitializeFrame.preparedCfgline 86 - theorem
OAI.UniqueGamesTheorem.Foundations.Complexity.PoweringInitializeFrame.initialGlobalTapes_eqline 92Source documentation
A homogeneous Boolean description of the machine's literal initial stacks.
theorem initialGlobalTapes_eq (graph : PortTables.Table vertices d) (n : Nat) : PoweringMachineInitialize.initialGlobalTapes (initialExtra graph n) = fun tape => if tape = PoweringMachineGlobal.inputTape n then PortTables.tableBits graph else [] := by …Mentions: OAI.UniqueGamesTheorem.Foundations.Complexity.PoweringMachineInitialize.initialGlobalTapes, OAI.UniqueGamesTheorem.Foundations.Complexity.PoweringInitializeFrame.initialExtra, OAI.UniqueGamesTheorem.Foundations.Complexity.PoweringMachineGlobal.inputTape
- theorem
OAI.UniqueGamesTheorem.Foundations.Complexity.PoweringInitializeFrame.machine_initialStacksline 107 - theorem
OAI.UniqueGamesTheorem.Foundations.Complexity.PoweringInitializeFrame.initList_eqline 114Source documentation
The trace starts at
Turing.initList, with no assumed prepared work tapes.theorem initList_eq (graph : PortTables.Table vertices d) (n : Nat) : initList (PoweringMachineGlobal.machine d n) (PortTables.tableBits graph) = ⟨some (PoweringMachineGlobal.main d n), PoweringMasterState.clean (PoweringMachineRowBody.bufferSize d n), PoweringMachineInitialize.initialGlobalTapes (initialExtra graph n)⟩ := by …Mentions: OAI.UniqueGamesTheorem.Foundations.Complexity.PoweringMachineGlobal.machine, OAI.UniqueGamesTheorem.Foundations.Complexity.PoweringMachineGlobal.main, OAI.UniqueGamesTheorem.Foundations.Complexity.PoweringMasterState.clean, OAI.UniqueGamesTheorem.Foundations.Complexity.PoweringMachineRowBody.bufferSize, OAI.UniqueGamesTheorem.Foundations.Complexity.PoweringMachineInitialize.initialGlobalTapes, OAI.UniqueGamesTheorem.Foundations.Complexity.PoweringInitializeFrame.initialExtra
- theorem
OAI.UniqueGamesTheorem.Foundations.Complexity.PoweringInitializeFrame.tableBits_headline 124Source documentation
The first serialized input field is the actual number of vertices.
theorem tableBits_head (graph : PortTables.Table vertices d) : PortTables.tableBits graph = encodeWord vertices ++ encodeWords (PortTables.tableWords graph).tail := rflMentions: OAI.UniqueGamesTheorem.Foundations.Complexity.encodeWord, OAI.UniqueGamesTheorem.Foundations.Complexity.encodeWords
- def
OAI.UniqueGamesTheorem.Foundations.Complexity.PoweringInitializeFrame.initializeInTimeline 130Source documentation
Initialization of the actual global program from its literal input list. Every work-tape readiness property follows from the explicit final frame.
def initializeInTime (graph : PortTables.Table vertices d) (n : Nat) : StateTransition.EvalsToInTime (PoweringMachineGlobal.machine d n).step (initList (PoweringMachineGlobal.machine d n) (PortTables.tableBits graph)) (some (preparedCfg graph n)) (3 * vertices + 5) := by …Mentions: OAI.UniqueGamesTheorem.Foundations.Complexity.PoweringMachineGlobal.machine, OAI.UniqueGamesTheorem.Foundations.Complexity.PoweringInitializeFrame.preparedCfg