Re: can we have another impasse about recursive and absorbative compression again?
- From: "guenther vonKnakspott" <apacur@xxxxxxxxx>
- Date: 30 Mar 2006 00:11:44 -0800
Threshold wrote:
<snip bla bla>
But I'm curious what things other than the counting principle say that
it isn't possible-and it'd be appreciated if the examples weren't based
on the counting principle either, although if you feel you must mention
one that is, it'd be nice if you could specify that. I just feel
anything based on the counting principle may as well BE the counting
principle, so it's not exactly an additional reason.
It is the counting theorem all the way. In fact if the contrary did
hold, let us call it the Uncounting Theorem: "A bijection can be
established between any two sets"; then anything would be compressible,
and any other reasons presented at your request would be invalid.
Regards.
.
- Follow-Ups:
- References:
- Prev by Date: Re: JPEG2000
- Next by Date: Re: question about entropy and compression method
- Previous by thread: Re: can we have another impasse about recursive and absorbative compression again?
- Next by thread: Please, PLEASE, hold your questions/comments/elsewhat til the end. Thank you. :)
- Index(es):