100% Compression Using Pi
21–30 of 34 posts
Re: 100% Compression Using Pi
#221. There is no proof that pi is a normal number. 2. The index of the position takes up space.
1. Well, here's to hoping. 2. He addressed this - you store the index in pi as well. If the index of the index is too big, you can store that too... indices all the way down!
Re: 100% Compression Using Pi
#23In 100 millons of digits of pi there is less than 1% of chances of finding a given 10 character string. Probably mankind wasnt on earth enough time to have calculated yet the amounts of digits that would imply finding there something big with high chances.
Re: 100% Compression Using Pi
#24Re: 100% Compression Using Pi
#25It's not a good compression algorithm because the offset into pi will require more digits to represent than the data you are trying to compress in the first place. Quite a lot more considering the law of big numbers. So ultimately this algorithm is going to expand the size of your data by some enormous factor.
No, you just have to store the offset as well. And the offset for the offset. Then you just have to keep track of the number of offset cycles you've gone through - and you can store this as well. Keep doing this until you have a number that is smaller than your file... might take a while, but it would be very elegant.
Re: 100% Compression Using Pi
#26Re: 100% Compression Using Pi
#27Re: 100% Compression Using Pi
#281. There is no proof that pi is a normal number. 2. The index of the position takes up space.
"Saving this file (attached) takes an infinite amount of time."
Re: 100% Compression Using Pi
#29The bigger the file, the lower the probability of finding an equivalent number (in pi) in this lifetime.