Thank you for mentioning those! I saw both Robotech and Macross Plus (in French) when I was a teenager. I still think about the SDF more often I would admit and the soundtrack is a regular occurrence in my work playlist :)
The secretary problem is a bad way to formalise the problem of dating and the stopping rule doesn't work in that context, for a very simple reason.
The secretary problem is a solution to the problem of having to make repeated choices. In essence it's a solution to the problem of having to choose a secretary every morning for the day. You can even say it's a solution to the problem of a computer process spending a few seconds consuming an infinite stream at the top of every hour for the next hour. It's not a solution to the problem of making a (hopefully) unique choice.
> I don’t know really how ppl that solve it fast accomplish getting to that level
Just like everything else in life, they do it really slow and with lots and lots and lots of errors at first, but (and this is where the magic happens) keep doing it, training hours a day or their entire week ends, for years.
JavaScript code and Haskell code ultimately both get turned into instructions for a microprocessor, so there really isn't much of a difference between both.
Yep, another developer enthusiastically proposing mmap as an "easy win" for database design, when in reality it often causes hard-to-debug correctness and performance problems.
BitTorrent is 20 years old, IPFS only 6. So, might just come down to familiarity. Definitively many more people, even outside tech crowd, have heard of BitTorrent whereas IPFS is still mostly unknown.