throwaway080383

16 ms·

151.
by throwaway080383 8y ago
I don't suppose you're a habitual user of HN?
152.
by throwaway080383 9y ago
TLOU is basically a movie. I played a few hours and got bored because it felt like I was watching mainly cutscenes with gameplay interspersed. Interesting movie, just not a great game .
153.
by throwaway080383 9y ago
What do you mean when you say the dodecahedron is a modular curve? Is there some N for which X_1(N) can be naturally thought of as a dodecahedron or something? Edit: Okay glanced at the arxiv paper linked below. The dodecahedron is not a mo
154.
by throwaway080383 9y ago
Click on the "..." above any ad and select "Why am I seeing this?"
155.
by throwaway080383 9y ago
I'm not sure I would paint traditional media companies, like say local news stations, as paragons of integrity, autonomy, and having a strong conscience. Exhibit A: https://youtu.be/hWLjYJ4BzvI
156.
by throwaway080383 9y ago
Duopolies are fine when the product isn't garbage, and I think most would agree that iPhones/Galaxies/Pixels aren't garbage. I'm much more concerned with the fact that Comcast keeps jacking up their prices, have wel
157.
by throwaway080383 9y ago
Since you are student at university, I would emphasize, in addition to your own reading: Talk to people who already understand the area . In office hours with your professor, or grad students, or even more senior undergrads. Just hang out
158.
by throwaway080383 9y ago
I had a quick question about this part: """ Two details are worth noting: * Once we leave a VM page through the bottom, it is important for performance that both child nodes live in the same VM page, because we are going to c
159.
by throwaway080383 9y ago
Doesn't look like it. One might argue that linear algebra is slightly more niche than stuff like graph theoretic algorithms. There are applications to broadly useful things like gradient descent, but that seems to fall under numerical
160.
by throwaway080383 9y ago
I'm sure the promotion committee had a tough time making that call...
161.
by throwaway080383 9y ago
Except exponential, log, log-linear, sqrt, the time or space complexity of pretty much every problem in CS...
162.
by throwaway080383 9y ago
Alternatively, set yourself a cutoff time of day for when you stop drinking. My girlfriend can drink coffee an hour before bed, but I need to take my last sip at least 8 hours before.
163.
by throwaway080383 9y ago
On a mobile device so hard to write out proper code, but basically as I understand it, for an n-qubit system, you could imitate this with a class containing - A length 2^n array of complex numbers, such that the sum of the norms of those nu
164.
by throwaway080383 9y ago
How about just replacing it with "intellectuals"?
165.
by throwaway080383 9y ago
>> You can see this in the clothes people wear A company-branded t-shirt and jeans?
166.
by throwaway080383 9y ago
Or perhaps (women's) education leads to abandoning religion.
167.
by throwaway080383 9y ago
The first thing you mentioned, annotations, or maybe even inline Q&A/discussions, was my dream in grad school (math). I imagined something like a separate MathOverflow for each paper. The basic problem is that I was constantly find
168.
by throwaway080383 9y ago
Yep, in C++ you can pass in a lambda to create the comparator inline: std::sort( myvec.begin(), myvec.end(), [](obj& A, obj& b) { return A.attr < B.attr; } );
169.
by throwaway080383 9y ago
They mean 10^9.
170.
by throwaway080383 9y ago
I think the problem is that the numerator and denominator in reduced form can easily get pretty big, even if the magnitude of the number itself isn't all that big. E.g. in the rational number 1 + 1/2 + 1/3 + ... + 1/24,
171.
by throwaway080383 9y ago
Right? Who still uses AOL?
172.
by throwaway080383 9y ago
As others have pointed out, there are (2^32)! such operations on 32-bit ints. However, I think it can be shown that the Kolmogorov complexity of most of these has to be O(lg((2^32)!)) which I think is rougly 32*2^32. In other words, you&#x2
173.
by throwaway080383 9y ago
(2, 3, 4) only applies to planar graphs, which the graph of a code base need not be. E.g. if you have n classes which all pairwise talk to each other, you'll need n colors.