I solved it, please read:)
Assume there is some ideal loss-less compression algorithm 𝑓. Because it is a compression, there is
at least one 𝑥, denote it 𝑥0 , such that |𝑓(𝑥0 )| < |𝑥0 |. Denote |𝑓(𝑥0 )| = 𝑛0 ∈ ℕ0 .
Consider the set 𝑆0 of all strings of the length not greater that 𝑛0 , this set is clearly finite. By ...
15 Million Students Helped!
Sign up to view the full answer