Lax434930.NondeterministicPolynomialSpace
The complexity class NPSPACE
concepts/Lax434930/NondeterministicPolynomialSpace.lean · lax-434930
No public endorsements yet.
Loading review…
Sign in with ORCIDConcept map
Definition
A binary language belongs to if one nondeterministic Turing machine decides membership using at most work cells on every branch on inputs of length , for some polynomial . All branches halt; at least one accepts precisely when the input belongs to the language. The input tape is read-only and excluded from work space.
Lean source view on GitHub
| 1 | import Lax434930.SpaceBounds |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: The complexity class NPSPACE |
| 6 | type: definition |
| 7 | --- |
| 8 | A binary language belongs to if one nondeterministic |
| 9 | Turing machine decides membership using at most work cells on |
| 10 | every branch on inputs of length , for some polynomial |
| 11 | . All branches halt; at least one accepts precisely |
| 12 | when the input belongs to the language. The input tape is read-only and |
| 13 | excluded from work space. |
| 14 | -/ |
| 15 | |
| 16 | namespace Lax434930.NondeterministicPolynomialSpace |
| 17 | |
| 18 | open PolynomialTime SpaceBounds |
| 19 | |
| 20 | /-- Nondeterministic polynomial work space. -/ |
| 21 | def NPSPACE : Set Language := |
| 22 | {A | ∃ p : Polynomial ℕ, A ∈ NSPACE p.eval} |
| 23 | |
| 24 | end Lax434930.NondeterministicPolynomialSpace |
| 25 |
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