Additional context (some of which Hughes might disagree with) on Wikipedia: https://en.m.wikipedia.org/wiki/Windsor_soup
1,443 karma · joined April 13, 2014
scientist.wang
Can someone explain how find works if the predicate is something like: return true if and only if every other bit is 1
And is finding any solution for a given n known to be in P? I saw a paper that found solutions up to 500,000 using a probabilistic method but wasn't sure if it was definitively proven to be in P or not.
In Mandarin: zhou, youtiao, and doujiang
This is the site mentioned and linked to in the article as a "site where you can actually watch live. And they have replays… of preliminary matches"
I've also found out to be quite good-- not sure why the author is so negative of it.