Re: Is this a legitimate compression scheme?
- From: Phil Carmody <thefatphil_demunged@xxxxxxxxxxx>
- Date: 16 Feb 2006 23:57:32 +0200
<dougwedel@xxxxxxxxxxxxx> writes:
A previous discussion in here has left me with this boiled-down question:
Suppose my computer contains in its memory the first 10 billion digits of
pi. Now suppose you generate a 10-digit random number and give it to me.
My computer program will compare your random number to its 10 billion digits
to see if at any point your 10-digit string exactly matches a 10-digit
stretch of pi. If the program finds a match, it returns the index into pi
(i.e. the Nth digit of pi) where your 10-digit string starts. If this index
has nine or fewer digits, would you agree that this is a legitimate
"compression" of your 10-digit number as the term "compression" is used in
algorithmic complexity or algorithmic information theory?
It falls into the family of techniques I like to call compression
by coincidence. It holds no interest for those who are interested
in compression.
Phil
--
What is it: is man only a blunder of God, or God only a blunder of man?
-- Friedrich Nietzsche (1844-1900), The Twilight of the Gods
.
- References:
- Is this a legitimate compression scheme?
- From: dougwedel
- Is this a legitimate compression scheme?
- Prev by Date: Re: Cantorian pseudomathematics
- Next by Date: Re: Sine wave construction using calculous or some approximation thereof - question.
- Previous by thread: Re: Is this a legitimate compression scheme?
- Next by thread: JSH: MAD fails
- Index(es):
Relevant Pages
|
