OAI/Computability/QuantumFactoring/TreeHistoryAccess.lean
9 declarations, 0 contain sorry, 0 declared as axioms
- def
OAI.ExactQuantumFactoring.NodeMachine.previousNetline 21Source documentation
Access only retained earlier wires. No history is recomputed.
def previousNet (t : ℕ) : BooleanNetwork (M.width (t+1)) (M.width t) := …
Mentions: OAI.ExactQuantumFactoring.BooleanNetwork
- def
OAI.ExactQuantumFactoring.NodeMachine.lastNodeNetline 24 - lemma
OAI.ExactQuantumFactoring.NodeMachine.previousNet_encodedline 28 - lemma
OAI.ExactQuantumFactoring.NodeMachine.lastNodeNet_encodedline 36 - def
OAI.ExactQuantumFactoring.NodeMachine.firstNodeNetline 46 - def
OAI.ExactQuantumFactoring.NodeMachine.firstRawline 49 - lemma
OAI.ExactQuantumFactoring.NodeMachine.firstNodeNet_encodedline 52 - lemma
OAI.ExactQuantumFactoring.NodeMachine.first_passedline 59 - lemma
OAI.ExactQuantumFactoring.NodeMachine.firstNodeNet_countline 64