Lax434930.NondeterministicLogarithmicSpace
The complexity class NL
concepts/Lax434930/NondeterministicLogarithmicSpace.lean · lax-434930
No public endorsements yet.
Loading review…
Sign in with ORCIDConcept map
Definition
A binary language belongs to if a nondeterministic Turing machine decides membership using work space and a separate read-only input tape. Every branch halts and respects the space bound; membership means that at least one branch accepts. The bound is for one positive constant .
Lean source view on GitHub
| 1 | import Lax434930.SpaceBounds |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: The complexity class NL |
| 6 | type: definition |
| 7 | --- |
| 8 | A binary language belongs to if a nondeterministic Turing |
| 9 | machine decides membership using work space and a separate |
| 10 | read-only input tape. Every branch halts and respects the space bound; |
| 11 | membership means that at least one branch accepts. The bound is |
| 12 | for one positive constant . |
| 13 | -/ |
| 14 | |
| 15 | namespace Lax434930.NondeterministicLogarithmicSpace |
| 16 | |
| 17 | open PolynomialTime SpaceBounds |
| 18 | |
| 19 | /-- Nondeterministic logarithmic work space. -/ |
| 20 | def NL : Set Language := |
| 21 | {A | ∃ c : ℕ, 0 < c ∧ A ∈ NSPACE (fun n => c * logSpace n)} |
| 22 | |
| 23 | end Lax434930.NondeterministicLogarithmicSpace |
| 24 |
Builds on
From Mathlib
none
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