1098

New compression technique (lemmy.nz)

submitted 1 day ago by sanitation@lemmy.today to c/programmer_humor@programming.dev

153 comments fedilink hide all child comments

you are viewing a single comment's thread
view the rest of the comments

[-] pressanykeynow@lemmy.world 27 points 19 hours ago

Could have just stored those in PiFS https://github.com/philipl/pifs

[-] sukhmel@programming.dev 16 points 17 hours ago* (last edited 17 hours ago)

That's nice, albeit I want to point out for anyone wondering that this is only conjectured and not guaranteed:

One of the properties that π is conjectured to have is that it is normal, which is to say that its digits are all distributed evenly, with the implication that it is a disjunctive sequence, meaning that all possible finite sequences of digits will be present somewhere in it.

There is no guarantee for any specific sequence to appear in π, but for short chunks chances are better (it's not really a probability, but it's simpler to say and I can't explain in details anyway). That's because (from wiki):

It is widely believed that the (computable) numbers √2, π, and e are normal, but a proof remains elusive.

[-] tetris11@feddit.uk 1 points 18 hours ago

It's pronounced "Piff Es" for anyone wondering

[-] Axolotl_cpp@feddit.it 5 points 15 hours ago* (last edited 11 hours ago)

Idk if it's irony, but the real pronounce is probably /paɪ ɛf-ɛs/ (english)
or /'pi fs/ in every other language that reads ~~letters as they are written~~ normally