Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
velis_vel
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
9 ms
·
61.
▲
by
velis_vel
13y ago
So, let me see if I understand you: * Angelhack dude either comparing software engineers to the 'working class' or insisting that said 'working class' should be kept away from software engineers, and in either case out a
62.
▲
by
velis_vel
13y ago
> unacceptable, impermissible opinion > crowdsourced rightthink pushback I can't tell what level of irony/sarcasm you're operating on here.
63.
▲
by
velis_vel
13y ago
This kind of 'well if it doesn't explicitly mention race it can't possibly be stereotypical' belief is nonsense. If I go 'oh me so solly!' everybody is going to know I'm stereotyping Asians (specifically
64.
▲
by
velis_vel
13y ago
If you look at the Wikipedia article on big-O notation, it says that f(x) = O(g(x)) if and only if there exists some M > 0 and x_0 such that |f(x)| < M|g(x)| for all x > x_0. The x_0 is what lets you ignore early irregularities; wi
65.
▲
by
velis_vel
13y ago
Because you've simplified it to the point of being incorrect. First, you've confused big-O, which is an upper bound, with big-theta, which is a strict bound. But leaving that aside, big-O also drops constant factors, and your expl
66.
▲
by
velis_vel
13y ago
Set basically has an Ord constraint on the type of things you have a Set of since most of the functions on it have an Ord a constraint, and Monads can't be constrained in what types they wrap. This is also why it's not a Functor;
67.
▲
by
velis_vel
13y ago
So I don't particularly feel like watching an entire hour-long video about something I'm already very familiar with for the sake of an argument on the internet; I'm just going to skim the video and look at the slides. He desc
68.
▲
by
velis_vel
13y ago
> For what it's worth, I'm far from alone in asserting that jQuery is indeed a monad. And a lot of people think that the reason astronauts float on the ISS is because there's no gravity there. > Since Haskell people cla
69.
▲
by
velis_vel
13y ago
> I know (and use) basically every other CS concept. Really? So you know and use row types, linear logic, rank-N types, impredicative types, red-black trees, generalized algebraic data types, continuations, kind-level polymorphism, patte
70.
▲
by
velis_vel
13y ago
http://i.imgur.com/4dZq0ZI.png Like that?
71.
▲
by
velis_vel
13y ago
> There is nothing whatsoever preventing a person of any sort from creating a code portfolio, and it's pretty easy to browse a github profile without learning anything about the demographics of the coder. Not if they use their name
72.
▲
by
velis_vel
13y ago
What? No. RSA doesn't depend on finding prime numbers, it depends on factoring large numbers, which is a completely separate problem. Elliptic curve cryptography doesn't depend on prime factorization at all. Even if they did, I do
73.
▲
by
velis_vel
13y ago
I don't think that you can really call a professor with a PhD 'Joe Average'.
74.
▲
by
velis_vel
13y ago
You're confusing pedantry with rigor. The fact that a compiler will complain at you if you misspell 'continue' but a mathematical proof will keep going just fine doesn't mean that programming is more 'rigorous'