59 karma · joined October 14, 2015
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.
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.
That they get so involved is the reason I participate (despite also working at the same time). I love the fact that the difficulty starts low and then goes up to levels where I feel really challenged. It's a month (well, 25 days) commitment which pays off the entire 11 other months for me :)
1. Update it every year or so, and 2. Everytime you update it you print a copy version and distribute that as needed.
Resulting from (1) removing irrelevant details (details crucial for an implementation, but irrelevant for an initial mental model) and (2) making use of analogies built around already known concepts.
"Complex maths" is never an excuse to not find that explanation.
Disclaimer: I am a pure mathematician.
When doing this, though, the problem is that it's more difficult to run search queries with the same expressiveness as we would otherwise do had the data been properly "unfolded" into many columns of a relational database.
This tool allows to make such expressive requests. This is very useful.
Interestingly the search query itself is expressed as a JSON object (this is a design choice, it could or could not have ben the case. In any case it's cute.)