throwaway55533

5 ms·

1.
by throwaway55533 2y ago
+1, pg is using a pretty typical argument you see in analysis/topology. If you want to get to real analysis/topology the typical sequence is 1. Logic and Set theory (recommendation: How to Prove It , Velleman) 2. Linear Algebra
2.
by throwaway55533 2y ago
Sure, maybe my definition was imprecise. Good catch. But my point remains. I don't feel like I should be compensated for my HN posts. My great aunt doesn't expect compensation for posting her cat pictures. To be honest, I don&#x
3.
by throwaway55533 2y ago
Ok, but the author referred specifically to "Creators", which usually means the minority of users who post things other than text. If you read more of the author's post: > We are a webcomic duo that has been creating orig
4.
by throwaway55533 2y ago
> Social Media platforms cannot grow without engaging and original content, made by people. This is the basis for any user to join. Creators have – in large part – not been privy to the rewards that these platforms have generated over th
5.
by throwaway55533 2y ago
How is it flawed logcally? Seems perfectly correct to me. Although I'd agree it's a bit over-literal. As if the emotional workings of the human mind can be precisely reasoned about (i.e. precisely enough to say "always")
6.
by throwaway55533 2y ago
no.
7.
by throwaway55533 2y ago
> government-mandated monopoly Could you expand on this, aren't U.S. car dealerships private businesses competing in a (mostly) unregulated market?
8.
by throwaway55533 2y ago
Mitigating the risk of downloading a script from the internet and executing it -- even from a "trusted" website or package manager -- is absolutely a good reason not to use it.
9.
by throwaway55533 2y ago
Ah. Is 8 bits really optimal? I don't know how many UTF space characters there are, I thought there were only a few. Why not a 16-bit lookup?
10.
by throwaway55533 2y ago
From reading the article, how is this more efficient? Doesn't any word counting algorithm have to iterate through all the characters and count spaces? What makes this better than the standard algorithm of wc = 0 prev = null