Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
aquamongoose
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
11 ms
·
1.
▲
by
aquamongoose
8y ago
Maybe because PhD programs in those fields already are free at every university (in fact, they pay you a stipend).
2.
▲
by
aquamongoose
8y ago
> Axiom of choice assumes that you can always pick the best possible option, however you need to be able to account for your worst possible options as well. All mathematical optimization falls outside of classical logic. Not sure what yo
3.
▲
by
aquamongoose
9y ago
No: (ii) only holds when e1, e2 come from the original vector space (not the product).
4.
▲
by
aquamongoose
12y ago
His would be: Still much more productive with vi keys! Yours would be: Still much productive with vi keys!
5.
▲
by
aquamongoose
12y ago
With regards to (2), this is one way of solving the problem. However, your solution uses O(n) memory (where n is the size of the linked list), and the tortoise-and-hare algorithm uses only O(1) memory. Here's how it works: http:/
6.
▲
by
aquamongoose
13y ago
True, but that's still O(n!), so the overall complexity doesn't change.
7.
▲
by
aquamongoose
13y ago
I think it's because a lot of his humor is self-deprecating, so many of his jokes are "on" him.