Lax Lean Archive

The complexity class L

Lax434930.LogarithmicSpace · concepts/Lax434930/LogarithmicSpace.lean · lax-434930

definition

Loading review…

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this concept may be incorrect.

No flags have been submitted.

    Community review

    Flag this concept

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    No source line selected.

    Natural Language Statement

    Definition

    A binary language belongs to L\mathrm{L} if a deterministic Turing machine decides membership using O(log⁡n)O(\log n) work space and a separate read-only input tape. Precisely, some positive constant cc bounds work space by c⌊log⁡2(n+2)⌋c\lfloor\log_2(n+2)\rfloor on every input of length nn.

    Concept map
    4 concepts; 1 descendant hidden
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A

    In the paper

    • page 2 of this submission's paper

    Lean source view on GitHub

    1import Lax434930.SpaceBounds
    2
    3/-!
    4---
    5title: The complexity class L
    6type: definition
    7---
    8A binary language belongs to L\mathrm{L} if a deterministic Turing machine
    9decides membership using O(log⁡n)O(\log n) work space and a separate read-only
    10input tape. Precisely, some positive constant cc bounds work space by
    11c⌊log⁡2(n+2)⌋c\lfloor\log_2(n+2)\rfloor on every input of length nn.
    12-/
    13
    14namespace Lax434930.LogarithmicSpace
    15
    16open PolynomialTime SpaceBounds
    17
    18/-- Deterministic logarithmic work space. -/
    19def L : Set Language :=
    20 {A | ∃ c : ℕ, 0 < c ∧ A ∈ DSPACE (fun n => c * logSpace n)}
    21
    22end Lax434930.LogarithmicSpace
    23
    Builds on
    Used by
    From Mathlib

    none

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above.

    Loading discussion…