Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
maweki
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
98 ms
·
451.
▲
by
maweki
7y ago
But solar failure rate and cost will never go down?
452.
▲
by
maweki
7y ago
one is a mathematical operator, the other is not
453.
▲
by
maweki
7y ago
In the example there was no talking about floating point numbers. The ordered type _has_ a total ordering as shown by the Ord typeclass restriction.
454.
▲
by
maweki
7y ago
Yeah, our bioinformatics department is already using anaconda extensively.
455.
▲
by
maweki
7y ago
I am sure citizens of Hong Kong, like citizens of Catalonia, do enjoy all the freedoms they are given.
456.
▲
by
maweki
7y ago
I did accessibility dev in the mid 2000s and hand-crafted accessible html (or stripped down templates) was - at that point - easily the number 1 search result for a relevant query. This was when css started to become useful and if you were
457.
▲
by
maweki
7y ago
In Venezuela you never know, when a company is owned by the state. In the US, on the other hand, we know that the state is owned by the companies. Much easier this way.
458.
▲
by
maweki
7y ago
It's not like Israel is - not talking about the truth of that claim here - denying the very existence of their neighbouring states. On the contrary, palestine and part of the palestine people are branded as great evil. Being branded as
459.
▲
by
maweki
7y ago
I think most people on Hacker-News would know that Taiwan exists, even though a flag is missing on their phone. I think for the general population in the US or Europe that's not so clear. If one would never hear about Taiwan, would we
460.
▲
by
maweki
7y ago
About three weeks ago I struggled to glue a tiny acryl/plastics figurine to a stone. Sadly, stone is missing from the glueable surfaces.
461.
▲
by
maweki
7y ago
And this is why we have a mandatory minimum work week instead of a maximum one, so that companies can get something ... anything ... done. Did I get this right?
462.
▲
by
maweki
7y ago
Why would a company keep spare parts around when it can sell a new device or only allow "certified" maintanance? Where is the incentive in letting a customer spend less money on parts and labour? How exactly can the market be doin
463.
▲
by
maweki
7y ago
They mean that you can specify dependencies. So start some service Y only after X has been started. I use this extensively in my home automation services. Can't start other services if the MQTT-Server hasn't started and that isn&#
464.
▲
by
maweki
7y ago
I think it's fine taking this as a constraint problem. It just means, you know beforehand that there is a solution. Also, if the underlying problem is in P, chances are the SAT instance is not that hard. Also: have you looked at the po
465.
▲
by
maweki
7y ago
This looks pretty nice but without secret management it's not really that useful. Without that you can't share your configs or have your config in your dotfiles-repository. That makes it really not that portable.
466.
▲
by
maweki
7y ago
The generator for X is shown and a filter is shown but not that you can put any expression for X instead of just X. And this corresponds to map while the other part, as shown corresponds to filter. So the full power is missing when you don&
467.
▲
by
maweki
7y ago
What's kinda missing in the whole article is that the member expression is actually map. The example is {x | generator(x) & filter(x) & filter(x)} while you could actually {f(x) | generator(x) ...} which is basically map(f,xs).
468.
▲
by
maweki
7y ago
Two comments: 1. I don't see how this would ever fit on six slides. I mean, I see the slides but how useful/standalone are they, even if taken as basis for presentation of that paper? 2. The author conflates Prolog with SLD resolu
469.
▲
by
maweki
7y ago
ASP does not have operational semantics in that sense, or an order of execution. It's a set of stable models that satisfy the clauses. Prolog with the SLD-resolution strategy (there are others but that's the presented one - even t
470.
▲
by
maweki
7y ago
When I teach or write about Haskell I try to break down the parts in a way that the parts can be tested using ghci and just composing it at the end. I think there are quite a few parts in there that one can easily "try out on their own
471.
▲
by
maweki
7y ago
I know it is hard to strike a good balance between academic and technical focus, especially when writing about haskell, but I think starting out with language extensions and imports without writing about what and how we're going to do
472.
▲
by
maweki
7y ago
In the worst case we can't get around exponential runtime in the problem size. This is problematic since encoding often is not even linear but quadratic or worse. But there are often tricks to get to encoding to nlogn size. Problems th
473.
▲
by
maweki
7y ago
For anybody reading this: IN THEORY In practice the nugget per package gets cheaper as the package size increases and therefore a greedy algorithm is very useful and probably linear in the number of package types.
474.
▲
by
maweki
7y ago
No. Linear optimization. Edit: Sorry. It's linear optimization with integers and therefore in the same complexity class as any other np complete problem.
475.
▲
by
maweki
7y ago
I think as a user if you have to think about the computational aspects of a query you're doing something wrong. From a declarative sense datalog is much more concise than SQL. Depending on how you want to think about it, it also subsum
476.
▲
by
maweki
8y ago
That's not high level design though. High level would be (for example) in Barker-notation were you have subclasses and n:m relationships are not represented as their own entities. Only as a next step you translate that to the actual re
477.
▲
by
maweki
8y ago
The diagrams in that way are problematic. When you model them as digraphs and use this layout and order them from too to bottom you get all the tables at the top that represent n:m relationships and at the bottom (at different levels) your
478.
▲
by
maweki
8y ago
Of course this tells me about the state of the variant. And it's the same invariant the author uses but with the equation balanced differently. The author's invariant is Sum = 1+2+..I Mine is Sum+(I+1)+...+X = 1+2+..I+(I+1)+...+X
479.
▲
by
maweki
8y ago
I think both for sum and max a better invariant should include the uncalculated part. Sum(0..X)=Sum(0..i)+sum(i+1..X) with the moving i. So it is true at first because the unsummed part is empty and the missing part is the goal. Then we tak
480.
▲
by
maweki
8y ago
I think 'safety' is the key term here. In the future we will see more self-driving cars and other self-... machines. I would like them to provably not crash (into me). If it were up to me, no matter the energy consumption, a piece
More ›