Logarithmic space for inductive counting
Lax362205.CountMachine · concepts/Lax362205/CountMachine.lean · lax-362205
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Lemma
For a machine using logarithmic space, a nondeterministic machine implements its configuration counting predicate in logarithmic space. Vertices and bounded paths are generated sequentially. Every branch halts.
Concept map
Evidence
Each proof establishes this claim relative to its assumptions.
In the paper
- page 3 of this submission's paper
Lean source view on GitHub
| 1 | import Lax362205.ConfigurationCounting |
| 2 | import Lax434930.SpaceBounds |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Logarithmic space for inductive counting |
| 7 | type: lemma |
| 8 | --- |
| 9 | For a machine using logarithmic space, a nondeterministic machine implements |
| 10 | its configuration counting predicate in logarithmic space. Vertices and |
| 11 | bounded paths are generated sequentially. Every branch halts. |
| 12 | -/ |
| 13 | |
| 14 | namespace Lax362205.CountMachine |
| 15 | |
| 16 | open Lax434930.PolynomialTime Lax434930.SpaceMachines Lax434930.SpaceBounds |
| 17 | open ConfigurationCounting |
| 18 | |
| 19 | axiom implement (M : Machine) (c : ℕ) (hc : 0 < c) |
| 20 | (hM : ∀ w, M.UsesSpace w (c * logSpace w.length)) : |
| 21 | ∃ (d : ℕ) (D : Machine), 0 < d ∧ |
| 22 | (∀ w, D.HaltsOn w ∧ (D.Accepts w ↔ RejectsByCounting M w (c * logSpace w.length))) ∧ |
| 23 | ∀ w, D.UsesSpace w (d * logSpace w.length) |
| 24 | |
| 25 | end Lax362205.CountMachine |
| 26 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments