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.
primaryTopic
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.
has abstract
In computational complexity th ...... ains all computable functions.
@en
圧縮定理(あっしゅくていり、英: compression t ...... (それは全ての計算可能関数を含む)が存在しないことを述べる。
@ja
Link from a Wikipage to an external page
Wikipage page ID
Wikipage revision ID
744,764,629
subject
hypernym
comment
In computational complexity th ...... ains all computable functions.
@en
圧縮定理(あっしゅくていり、英: compression t ...... (それは全ての計算可能関数を含む)が存在しないことを述べる。
@ja
label
Compression theorem
@en
圧縮定理
@ja