This is smart. As pi is a non-repeating, you can even at some point start showing just the “current” digits if it ever gets too much, and will always be able to find a finite length of digits that does not match a previously user version number.
Not necessarily. Non-repeating doesn’t mean the are no repeated sections. For example, in the first hundred million digits “1412” is found three times.
For practical purposes, it’s probably good enough. You could write a program to check whether it’s non-repeating up to N digits, so just set N high enough that it will last you for a few thousand releases…
Yeah tom7 did a video on ‘badness’ in TeX: www.youtube.com/watch?v=Y65FRxE7uMcI am learning ins-and-outs of TeX because I am implementing it in OCaml. btw, tom7 is a really stand-up fella. His thesis on “Modal types for Mobile Code” seems very interesting. He mentions it in the video. This is the thesis: www.cs.cmu.edu/…/modal-types-for-mobile-code.pdf
(mobile code is ‘network’ code, basically JavaScript – Tom’s work, I believe, is concerned with formal verification of web code – if you are a webdev, read it!)
That’s one of those moments the question is so ridiculous you have to say yes. Like, I don’t own any such thing and don’t have a licence, but it would be hilarious to do.
There is an advantage to this approach though: fewer errors. You’re plucking a known working command from a list instead of manually typing a (possibly) broken version of it. Worse yet is when it’s a command where typematic mistakes cause unintended side effects like data loss. So, mashing up 100 times can be pretty smart, especially if you’re not a great typist.
At work, was recently working on a script that alters the repo significantly. Every time I tested the script, I used the up arrow to get the git clean and git checkout HEAD – files commands to reset the repo. I must’ve used those 100+ times.
programmer_humor
Newest
This magazine is from a federated server and may be incomplete. Browse more on the original instance.