Techniqueintro
Information-theoretic lower bound
Also called information-theory lower bound, entropy lower bound.
Counts the possible outputs; a tree of depth d has at most 2^d leaves, so depth is at least log of the output count.
Counts the possible outputs; a tree of depth d has at most 2^d leaves, so depth is at least log of the output count.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag BH03QV Edit this page History Report an error