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
Then there exists a total computable function
and
References
Compression theorem Wikipedia(Text) CC BY-SA