Re: More of an Algorithems question
- From: cri@xxxxxxxx (Richard Harter)
- Date: Wed, 16 Nov 2005 14:25:56 GMT
On 15 Nov 2005 14:55:51 -0800, "Filter" <filtermedialtd@xxxxxxxxx>
wrote:
>
>Hi,
>
>How can I proove that no Algorithm can compress every file of length
>10^6?
The number of files of length n is 2^n; the number of files of length
..lt. n is 2^n-1. Take it from there.
Richard Harter, cri@xxxxxxxx
http://home.tiac.net/~cri, http://www.varinoma.com
I started out in life with nothing.
I still have most of it left.
.
- References:
- More of an Algorithems question
- From: Filter
- More of an Algorithems question
- Prev by Date: Re: Discrete Subgroup
- Next by Date: Re: More of an Algorithems question
- Previous by thread: Re: More of an Algorithems question
- Next by thread: Re: More of an Algorithems question
- Index(es):
Relevant Pages
|
