A Gödel Theorem on Network Complexity Lower Bounds (Q3708019): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:01, 5 February 2024
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
