OAI/Computability/UniqueGames/Machines/GraphCounterModel.lean
26 declarations, 0 contain sorry, 0 declared as axioms
A fixed Boolean-stack program prepending the logarithmic round count to a graph table. It copies the original word, adds its two unary header values, runs the actual logarithm machine, then emits the counter and original word.
- inductive
OAI.UniqueGamesTheorem.Foundations.Complexity.GraphCounterModel.ExtraTapeline 15 - abbrev
OAI.UniqueGamesTheorem.Foundations.Complexity.GraphCounterModel.ExtraTape.enumListline 19 - theorem
OAI.UniqueGamesTheorem.Foundations.Complexity.GraphCounterModel.ExtraTape.enumList_getElem?_ctorIdx_eqline 21 - theorem
OAI.UniqueGamesTheorem.Foundations.Complexity.GraphCounterModel.ExtraTape.enumList_nodupline 25 - instance
OAI.UniqueGamesTheorem.Foundations.Complexity.GraphCounterModel.(instance at line 27)line 27 - inductive
OAI.UniqueGamesTheorem.Foundations.Complexity.GraphCounterModel.ExtraLabelline 31 - abbrev
OAI.UniqueGamesTheorem.Foundations.Complexity.GraphCounterModel.ExtraLabel.enumListline 36 - theorem
OAI.UniqueGamesTheorem.Foundations.Complexity.GraphCounterModel.ExtraLabel.enumList_getElem?_ctorIdx_eqline 39 - theorem
OAI.UniqueGamesTheorem.Foundations.Complexity.GraphCounterModel.ExtraLabel.enumList_nodupline 43 - instance
OAI.UniqueGamesTheorem.Foundations.Complexity.GraphCounterModel.(instance at line 45)line 45 - abbrev
OAI.UniqueGamesTheorem.Foundations.Complexity.GraphCounterModel.Tapeline 49 - abbrev
OAI.UniqueGamesTheorem.Foundations.Complexity.GraphCounterModel.Labelline 50 - abbrev
OAI.UniqueGamesTheorem.Foundations.Complexity.GraphCounterModel.Alphabetline 51 - abbrev
OAI.UniqueGamesTheorem.Foundations.Complexity.GraphCounterModel.Stateline 52 - def
OAI.UniqueGamesTheorem.Foundations.Complexity.GraphCounterModel.initialStateline 54 - def
OAI.UniqueGamesTheorem.Foundations.Complexity.GraphCounterModel.clockLabelline 56 - def
OAI.UniqueGamesTheorem.Foundations.Complexity.GraphCounterModel.clockStatementline 61Source documentation
Homogeneous Boolean embedding of the fixed logarithm program.
def clockStatement : TM2.Stmt MachineLogCounter.Alphabet (Fin 5) MachineLogCounter.State → TM2.Stmt Alphabet Label State | .push k f next => .push (.inl k) (fun state => f state.1) (clockStatement next) | .peek k f next => .peek (.inl k) (fun state x => (f state.1 x, state.2)) (clockStatement next) | .pop k f next => .pop (.inl k) (fun state x => (f state.1 x, state.2)) (clockStatement next) | .load f next => .load (fun state => (f state.1, state.2)) (clockStatement next) | .branch f yes no => .branch (fun state => f state.1) (clockStatement yes) (clockStatement no) | .goto f => .goto (fun state => .inl (f state.1)) | .halt => .goto (fun _ => .inr .clearInput)Mentions: OAI.UniqueGamesTheorem.Foundations.Complexity.MachineLogCounter.Alphabet, OAI.UniqueGamesTheorem.Foundations.Complexity.MachineLogCounter.State, OAI.UniqueGamesTheorem.Foundations.Complexity.GraphCounterModel.Alphabet, OAI.UniqueGamesTheorem.Foundations.Complexity.GraphCounterModel.Label, OAI.UniqueGamesTheorem.Foundations.Complexity.GraphCounterModel.State
- def
OAI.UniqueGamesTheorem.Foundations.Complexity.GraphCounterModel.readHeaderline 71 - def
OAI.UniqueGamesTheorem.Foundations.Complexity.GraphCounterModel.programline 77 - def
OAI.UniqueGamesTheorem.Foundations.Complexity.GraphCounterModel.machineline 95 - def
OAI.UniqueGamesTheorem.Foundations.Complexity.GraphCounterModel.clockTapesline 106 - def
OAI.UniqueGamesTheorem.Foundations.Complexity.GraphCounterModel.clockConfigurationline 110 - theorem
OAI.UniqueGamesTheorem.Foundations.Complexity.GraphCounterModel.clockTapes_updateline 114 - theorem
OAI.UniqueGamesTheorem.Foundations.Complexity.GraphCounterModel.clockStatement_simulationline 121 - theorem
OAI.UniqueGamesTheorem.Foundations.Complexity.GraphCounterModel.clockStepline 146 - def
OAI.UniqueGamesTheorem.Foundations.Complexity.GraphCounterModel.clockInTimeline 161