Had an idea - looking for a math buff to tell me if it's possible?with today's technology.

Sudeep Khuraijam skhuraijam at liveops.com
Fri May 20 21:16:25 UTC 2011

I could not help but admire nanog in its full form ;)  and I cannot resist anymore.  Allow me to suggest the EPR paradox machine.

The cost of regenerating  unpredictable information is inefficient  by orders of magnitude, but wait... isn't it what we are trying to solve?

On May 20, 2011, at 1:32 PM, Paul Timmins wrote:

On 05/20/2011 03:34 PM, Paul Graydon wrote:
On 05/20/2011 08:53 AM, Brett Frankenberger wrote:
Even if those problems were solved, you'd need (on average) just as
many bits to represent which digit of pi to start with as you'd need to
represent the original message.

     -- Brett
Not quite sure I follow that. "Start at position xyz, carry on for
10000 bits" shouldn't be as long as telling it all 10000 bits?

Currently we have a compression algorithm for doing this already in
widespread use. We create a list of numbers ranging from 1 to 255 and
then provide an index into that array. We save space by assuming it's a
single character.

Sudeep Khuraijam | Netops | liveops | Office 408 8442511 | Mobile 408 666 9987
skhuraijam at liveops.com<mailto:skhuraijam at liveops.com> | aim: skhuraijam

More information about the NANOG mailing list