Compression theorem
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.
 | This computer science article is a stub. You can help Wikipedia by expanding it. |