| Topic Four:
Limits to compression |
|
|
|
|
|
|
|
|
|
|
| n | We
can not in principle come up with an |
||||||||
| algorithm
for performing the maximum |
|||||||||
| compression
on any bit sequence. |
|||||||||
| n | 3/7
is a rule of arithmetic, an algorithm that |
||||||||
| generates
the sequence 0.42857142857 |
|||||||||
| n | So
this sequence is presumably less random |
||||||||
| than
0.32857142877 ( changed 2
digits) |
|||||||||
| n | But
we can never be sure. |
||||||||