Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
CaptainNegative
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
23 ms
·
91.
▲
by
CaptainNegative
3y ago
This HN post has a misleading title (as of the time of this comment). They backed out of a climate pledge (50% delivery emissions reduction by 2030), not "The" Climate Pledge (100% cross-sector carbon neutral by 2040 and a few oth
92.
▲
by
CaptainNegative
3y ago
Outside of binary planets orbiting each other, is this achievable as a (mostly) stable configuration? Intuitively, if the two planets have orbiting periods that are not basically identical, then after long enough they will also have long st
93.
▲
by
CaptainNegative
3y ago
1. Ads in the Start Menu. 2. Ads in the rest of the OS.
94.
▲
by
CaptainNegative
3y ago
Not to mention that QuickSort isn't a single algorithm but rather a class of algorithms (as the choice of pivot is left unspecified), and there are methods to choose the pivot that give O(n log n) worst case or O(n log n) expected runn
95.
▲
by
CaptainNegative
3y ago
rekt.browser
96.
▲
by
CaptainNegative
3y ago
I think at this point everyone's seen this comic.
97.
▲
by
CaptainNegative
3y ago
I'm not sure what you're referring to here. Ramsey's theorem is constructive enough that you can extract an upper bound of 4^k on the kth diagonal Ramsey number, and the (j,k)th Ramsey number is bounded from above by the max(
98.
▲
by
CaptainNegative
3y ago
I don't know which airlines are packing one-dimensional bins :). In dimensions 2 and above, bin packing has no PTAS unless P=NP, and in particular it's hard to derive anything with an approximation ratio appreciably better than sq
99.
▲
by
CaptainNegative
3y ago
Dense k-Subgraph, eh? I wrote a dissertation on that in a past life. From a quick read of the paper, it looks like the only classical algorithms they compare to are greedy, random search, and simulated annealing (which is more or less rando
100.
▲
by
CaptainNegative
3y ago
> OpenAI have a 10000 A100 training farm that they are expanding to 2500. Does the first number have an extra zero or is the second number missing one?
101.
▲
by
CaptainNegative
3y ago
This article is incomplete without any mention of strong privacy techniques such as differential privacy. There is a write-up by Cohen and Nissim [1] where they analyze the privacy statutes in the GDPR and derive a formal definition of priv
102.
▲
by
CaptainNegative
3y ago
Silly question, how did they get their patent granted in 16 months when I have some patents pending for more than 3x as long?
103.
▲
by
CaptainNegative
3y ago
Those estimates typically confuse the 10^100 upper bound on the number of atoms in the universe with 2^100. The 2^128 number of addresses in IPv6 is clearly more than the latter, but dwarfed by the former. There are roughly 10^40 or so at
104.
▲
by
CaptainNegative
3y ago
> Article: By comparison, common crimes like burglary, larceny and theft cost just $16 billion per year. (FBI) > FBI: Collectively, victims of property crimes (excluding arson) suffered losses estimated at $16.4 billion in 2018. Those
105.
▲
by
CaptainNegative
3y ago
> I wish I lived in a city where 2 converter thefts every 4 decades was the bar for "serious theft problem". I don't think this is fair at all. If a couple pre-teens get third degree burns because an arsonist burned their
106.
▲
by
CaptainNegative
3y ago
Only if they're (i) conjectured hard instances (ii) for which we can verify that a given solution is indeed optimal. Which in many cases is itself is a Gödel prize worthy task.
107.
▲
by
CaptainNegative
3y ago
Seems like pretending to know what the word emergent means in physics is an emergent phenomenon on HN. It's not wishy washy, it has a precise meaning that can be both derived and, typically, refuted.
108.
▲
by
CaptainNegative
3y ago
The topic here is about animals who are fed excessive quantities of antibiotics while healthy, fattening them up to the point that their skeletons frequently fracture because they can't bear the weight. These are not well-treated "
109.
▲
by
CaptainNegative
3y ago
I don't get it. In most circumstances, if one doesn't want to be called immoral for performing an objectively cruel act, the standard course of action would be to stop doing it. Why would one who inflicts or remunerates mistreatme
110.
▲
by
CaptainNegative
3y ago
$300 sounds pretty comparable to an overnight stay at a hotel room.
111.
▲
by
CaptainNegative
3y ago
Amazon Meconical Turk
112.
▲
by
CaptainNegative
3y ago
Taking g(x) = f(x) + epsilon*cos(bx) adds to the derivatives a function that bounces between -b*epsilon and b*epsilon while g remains within an epsilon envelope of f. Take b large enough to fit your needs, e.g. 100/epsilon times an upp
113.
▲
by
CaptainNegative
3y ago
An equivalent formulation to the SO solution with a simple implementation is to double the vertices and edges in the graph G by making a duplicate parallel universe G'. One can always move from v in G to its corresponding v' in G&
114.
▲
by
CaptainNegative
4y ago
In principle it could be approaching us at near the speed of light (for example, if it was hit by something big going near the speed of light from the other direction a few days after the presently observed light was emitted) and we would n
115.
▲
by
CaptainNegative
4y ago
What do you dislike about 95?
116.
▲
by
CaptainNegative
4y ago
OpenAI keeps text-davinci-003 proprietary.
117.
▲
by
CaptainNegative
4y ago
This is what showed up for me https://cdn.discordapp.com/attachments/519791942654230528/10... .
118.
▲
by
CaptainNegative
4y ago
Do undergraduate mathematics journals ever desk-reject sincere attempts?
119.
▲
by
CaptainNegative
4y ago
Precedent for federal cases is typically first set at the appellate level. If you're working your activism through the courts, you usually have to lose before you can win.
120.
▲
by
CaptainNegative
4y ago
> NP-complete problems are those that, if any one of them can be solved in polynomial time, then all NP problems can be solved in polynomial time. That is (nearly) correct under Cook reductions but not Karp reductions. I say "nearly
More ›