In computer science it is useful to compress "strings and other data for the purpose
6.
saving space/transmission time. For example, in a text file we might want to replace all strings the by and discrete by 6#. For this, we assume we have a fixed finite alphabet of symbols available, say a, b, c,...z, A, B, C,..., Z,0,1,2,3,...,9, plus a space symbol plus some finite list of special symbols K, d. #.... A universal lossless compression algorithm is an algorithm that rewrites every string as something shorter. Show that such an algorithm cannot exist (use PHP). ¹3
Comments
Leave a comment