- Compression theorem
- References
In computational complexity theory the compression theorem is an important theorem about the complexity of computable functions.
The theorem states that there exists no largest complexity class, with computable boundary, which contains all computable functions.
Compression theorem
Given a Gödel numbering 
of the computable functions and a Blum complexity measure 
where a complexity class for a boundary function 
is defined as
Then there exists a total computable function so that for all 
and
References
- {{citation|title=Computation and Automata|volume=25|series=Encyclopedia of Mathematics and Its Applications|first=Arto|last=Salomaa|authorlink=Arto Salomaa|publisher=Cambridge University Press|year=1985|isbn=9780521302456|contribution=Theorem 6.9|pages=149–150|url=https://books.google.com/books?id=IblDi626fBAC&pg=PA149}}.
- {{citation|title=Computational Complexity: A Quantitative Perspective|volume=196|series=North-Holland Mathematics Studies|first=Marius|last=Zimand|publisher=Elsevier|year=2004|isbn=9780444828415|contribution=Theorem 2.4.3 (Compression theorem)|page=42|url=https://books.google.com/books?id=j-nhMYoZhgYC&pg=PA42}}.
3 : Computational complexity theory|Structural complexity theory|Theorems in the foundations of mathematics
- Two-colored cymbidium
- Two-color Technicolor
- Two-component regulation systems
- Two-component regulatory system
- Two-component system
- Two component system
- Two Concert Études (Liszt)
- Two Confessions
- Two Conversions
- Two Corny Crows
- Two Creeks AFS
- Two Creeks Air Force Station
- Two Crowded Hours
- Two Crude (1991 arcade game)
- Two Crude Dudes
- Two-cycle
- Two-cycle engine
- Two cycle interest
- Two Dancers
- Two Dark Birds
- Two dark birds
- Two Daughters
- Two Daughters (film)
- Two Daughters (Numb3rs)
- Two Days in November