Lax Lean Archive

Proof of `Logarithmic space for inductive counting`

groundedproofs/Lax362205Proofs/CountingMachine.lean · lax-362205

What this proof establishes

lem✓Lax362205.CountMachine

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

In the paper

  • page 3 of this submission's paper

Description

Compile the sequential path and census loops to a finite Turing machine. Every branch halts and every register has logarithmic length.