Documentation

Complexitylib.Circuits.DepthThree.LowerBound.Internal.TapeFill

Unrestricted depth-three lower bound: tape fill #

Adapted from OpenAI's formalization at revision adc7f1241b42e322a6451854ab7e4b4c146bf78a. Source: https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/lean/OAI/Computability/DepthThree/TapeFill.lean

Imports, namespaces, module visibility, documentation, and formatting are adapted for complexitylib. The source theorem statements and mathematical proofs are retained.

Transition function for the push stage of the fill routine.

Equations
Instances For
    @[reducible, inline]

    Control states for the fill stage of the fill routine.

    Equations
    • One or more equations did not get rendered due to their size.
    Instances For

      Transition function for the fill stage of the fill routine.

      Equations
      • One or more equations did not get rendered due to their size.
      Instances For
        theorem Complexity.DepthThreeLowerBound.TapeFill.runs_fill {counter destination : TapeRegister} (hne : counter ≠ destination) (b : Bool) (T : TapeTapes) (n : ℕ) (bits : List Bool) :
        RunsIn (fillProgram counter destination b).step (TapeMultiProgram.cfg fillStart (TapeCopy.onPair counter destination T (TapeUnary.counterTape n) (wordTape bits))) (TapeMultiProgram.cfg fillDone (TapeCopy.onPair counter destination T (TapeUnary.counterTape 0) (wordTape (List.replicate n b ++ bits)))) (8 * n + 3)
        @[simp]
        theorem Complexity.DepthThreeLowerBound.TapeFill.fill_done (counter destination : TapeRegister) (b : Bool) (h : TapeHeads) :
        fillProgram counter destination b fillDone h = none