Lax307052.SearchMachine
Space bound for the search machine
concepts/Lax307052/SearchMachine.lean · lax-307052
No public endorsements yet.
Loading review…
Sign in with ORCIDConcept map
Evidence
Each proof establishes this claim relative to its assumptions.
Lemma
The deterministic machine constructs the space bound, encodes configurations, and evaluates recursive reachability using parallel stacks. Its work space is quadratic in the original machine's space bound.
Lean source view on GitHub
| 1 | import Lax307052.ConfigurationGraph |
| 2 | import Lax307052.SpaceConstructibility |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Space bound for the search machine |
| 7 | type: lemma |
| 8 | --- |
| 9 | The deterministic machine constructs the space bound, encodes configurations, |
| 10 | and evaluates recursive reachability using parallel stacks. Its work space |
| 11 | is quadratic in the original machine's space bound. |
| 12 | -/ |
| 13 | |
| 14 | namespace Lax307052.SearchMachine |
| 15 | |
| 16 | open Lax434930.PolynomialTime Lax434930.SpaceMachines Lax434930.SpaceBounds |
| 17 | open ConfigurationGraph SpaceConstructibility |
| 18 | |
| 19 | axiom implement (M : Machine) (s : ℕ → ℕ) (hs : Constructible s) |
| 20 | (hlog : ∀ n, logSpace n ≤ s n) |
| 21 | (hM : ∀ w, M.UsesSpace w (s w.length)) : |
| 22 | ∃ (c : ℕ) (D : Machine), 0 < c ∧ D.Deterministic ∧ |
| 23 | (∀ w, D.HaltsOn w ∧ (D.Accepts w ↔ SearchAccepts M w (s w.length))) ∧ |
| 24 | ∀ w, D.UsesSpace w (c * (s w.length) ^ 2) |
| 25 | |
| 26 | end Lax307052.SearchMachine |
| 27 |
Community review
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above; your ORCID profile must share a public name.
0 comments