Theoremintro
Incompressibility argument
Also called counting argument for compression.
Counting shows that no lossless scheme shortens every input, so most strings are incompressible.
Counting shows that no lossless scheme shortens every input, so most strings are incompressible.
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 DZF65X Edit this page History Report an error