Lax434930.LogarithmicSpace
The complexity class L
concepts/Lax434930/LogarithmicSpace.lean · lax-434930
No public endorsements yet.
Loading review…
Sign in with ORCIDConcept map
Definition
A binary language belongs to if a deterministic Turing machine decides membership using work space and a separate read-only input tape. Precisely, some positive constant bounds work space by on every input of length .
Lean source view on GitHub
| 1 | import Lax434930.SpaceBounds |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: The complexity class L |
| 6 | type: definition |
| 7 | --- |
| 8 | A binary language belongs to if a deterministic Turing machine |
| 9 | decides membership using work space and a separate read-only |
| 10 | input tape. Precisely, some positive constant bounds work space by |
| 11 | on every input of length . |
| 12 | -/ |
| 13 | |
| 14 | namespace Lax434930.LogarithmicSpace |
| 15 | |
| 16 | open PolynomialTime SpaceBounds |
| 17 | |
| 18 | /-- Deterministic logarithmic work space. -/ |
| 19 | def L : Set Language := |
| 20 | {A | ∃ c : ℕ, 0 < c ∧ A ∈ DSPACE (fun n => c * logSpace n)} |
| 21 | |
| 22 | end Lax434930.LogarithmicSpace |
| 23 |
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