Thread: WARNING: Do NOT calculate Pi in binary
View Single Post
Unread 6 Nov 2003, 16:44   #21
acropolis
Vermin Supreme
 
acropolis's Avatar
 
Join Date: Jul 2000
Location: Pittsburgh
Posts: 3,280
acropolis single handedly makes these forums a better placeacropolis single handedly makes these forums a better placeacropolis single handedly makes these forums a better placeacropolis single handedly makes these forums a better placeacropolis single handedly makes these forums a better placeacropolis single handedly makes these forums a better placeacropolis single handedly makes these forums a better placeacropolis single handedly makes these forums a better placeacropolis single handedly makes these forums a better placeacropolis single handedly makes these forums a better placeacropolis single handedly makes these forums a better place
Re: WARNING: Do NOT calculate Pi in binary
Quote:
Originally Posted by W
I think you missed my point.

If you have a bitstring containing all bitstring of 20 bits lenght, it's impossible that this bitstring be SHORTER than 2^20+20-1 bits long. So to give any subposition within this (optimal) bitstring, you'd need 20 bits. This is if none of the 20-bit strings within it is repeated. In pi, they are, pi has no such guarantee of optimality (as can be shown by noting that the first 10 decimals in decimal are not the 10 different digits)

Even if it was optimal, there'd be no average compression (as with ANY compression algorithm. That's right, no compression algorithm has an average gain on a random file)
000
001
010
011
100
101
110
111
1100010111
heh. that's neat.
acropolis is offline   Reply With Quote