OAI/Combinatorics/ParityLifts/Machines.lean
23 declarations, 0 contain sorry, 0 declared as axioms
Finite-alphabet deterministic multitape model. A transition reads and writes only the currently scanned cell on each tape and moves each head by at most one cell.
- inductive
OAI.ParityWL.Complexity.Moveline 12 - instance
OAI.ParityWL.Complexity.(instance at line 15)line 15 - def
OAI.ParityWL.Complexity.Move.offsetline 18 - structure
OAI.ParityWL.Complexity.Machineline 25Source documentation
Blank is 0, input bits are 1 and 2. Every work alphabet, state space and collection of tapes is finite. Tapes are two-way infinite.
structure Machine where …
- structure
OAI.ParityWL.Complexity.Configurationline 35 - def
OAI.ParityWL.Complexity.inputSymbolline 40 - def
OAI.ParityWL.Complexity.initialConfigurationline 43 - def
OAI.ParityWL.Complexity.stepline 52 - def
OAI.ParityWL.Complexity.runline 61 - def
OAI.ParityWL.Complexity.Emitsline 64 - structure
OAI.ParityWL.Complexity.LocalMachineline 75Source documentation
A finite-control presentation of the very same local multitape model.
packedbelow changes ONLY the names of states, with zero simulation cost.structure LocalMachine (Q : Type) (t a : ℕ) where …
- structure
OAI.ParityWL.Complexity.LocalConfigurationline 81 - def
OAI.ParityWL.Complexity.localInputSymbolline 86 - def
OAI.ParityWL.Complexity.LocalMachine.initialConfigurationline 89 - def
OAI.ParityWL.Complexity.LocalMachine.stepline 99 - def
OAI.ParityWL.Complexity.LocalMachine.runline 109 - def
OAI.ParityWL.Complexity.LocalMachine.stateEquivline 113 - def
OAI.ParityWL.Complexity.LocalMachine.packedline 118 - def
OAI.ParityWL.Complexity.LocalMachine.packConfigurationline 128 - lemma
OAI.ParityWL.Complexity.LocalMachine.pack_initialline 134 - lemma
OAI.ParityWL.Complexity.LocalMachine.pack_stepline 139 - lemma
OAI.ParityWL.Complexity.LocalMachine.pack_runline 146 - lemma
OAI.ParityWL.Complexity.LocalMachine.packed_emitsline 155