A Gödel Theorem on Network Complexity Lower Bounds (Q3708019)

From MaRDI portal
Revision as of 01:23, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A Gödel Theorem on Network Complexity Lower Bounds
scientific article

    Statements

    A Gödel Theorem on Network Complexity Lower Bounds (English)
    0 references
    1986
    0 references
    incompleteness
    0 references
    lower complexity bounds
    0 references
    Boolean functions
    0 references
    minimal proof length
    0 references
    formal proof system
    0 references

    Identifiers