Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
ngruhn
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
21 ms
·
331.
▲
by
ngruhn
3y ago
I keep hearing this and I'm very interested. But most recommended resources I've seen so far are more targeted at Physicists. Any good text book for CS people? Edit: nevermind, read in other comments that https://bivect
332.
▲
by
ngruhn
3y ago
For me the big advantage is that it integrates much easier with my development environment. For example if I have a language server for some programming language running in Docker, it’s not obvious to me how to make it talk to my editor on
333.
▲
by
ngruhn
3y ago
Haven’t used it much but Dhall is a non Turing complete configuration language: https://dhall-lang.org/
334.
▲
by
ngruhn
3y ago
Interesting. Can you give some details what you did there. What exactly is a horn clause modeling here?
335.
▲
by
ngruhn
3y ago
That doesn’t mean that it’s impossible, right? Just that no tool is guaranteed to give an answer in any case. And those cases might be 90%, 10% or it-doesn’t-matter-in-practice %
336.
▲
by
ngruhn
3y ago
I think there was already an incident where an airline chatbot promised a discount that didn't exist. And then they got sued for it.
337.
▲
by
ngruhn
3y ago
damn, I'll try that
338.
▲
by
ngruhn
3y ago
The details are pretty math heavy but what these solvers are doing is they try to find an optimal assignment to a bunch of variables x,y,z,etc while respecting a bunch of constraints like 3x + 2y <= 10 4z >= 3.5 Additionally, there is
339.
▲
by
ngruhn
3y ago
I’m saying this because most people got from their CS degree that NP hardness is practically a death sentence. But it‘s really not true. Even if the problem is proven to be NP hard (or worse) and every previous approach has failed. There ca
340.
▲
by
ngruhn
3y ago
These solvers really show that NP-hardness is no reason to give up. For example, they can solve surprisingly large Traveling Salesmen instances to proven optimality.
341.
▲
by
ngruhn
3y ago
Not quite the same. But I guess in Emacs you can have code alongside text alongside images and graphics for pretty much any programming language. Another related concept is literate programming. There comments and code kind of switch roles.
342.
▲
by
ngruhn
3y ago
I think this is actually pretty common in the JavaScript ecosystem. Presumably, because contributors are very skilled in building websites and maybe also because users have higher expectations when it comes to presentation. I mean checkout
343.
▲
by
ngruhn
3y ago
Both languages are relational, which is fairly unique among programming languages. For example you can define a graph in Prolog like this: edge(1, 2). edge(2, 3). edge(3, 4). These edges are naturally undirected. Similarly, in SQ
344.
▲
by
ngruhn
3y ago
I guess this is rather category #2 than #3, but my favorite example is Advent of Code 2021, day 24: https://adventofcode.com/2021/day/24 . I think many people consider this one of the hardest AOC problems ever and
345.
▲
by
ngruhn
3y ago
I think he's just using it as a test here. He forces infinite backtracking by adding false to the query. You wouldn't do that in an actual program.
346.
▲
by
ngruhn
3y ago
Sure, but in practice that’s not what people worry about, from what I have seen. At least when dealing with SMT problems, the SAT part is the easy part.
347.
▲
by
ngruhn
3y ago
Traveling salesmen is even solved to optimality (no heuristics) for pretty large instances with integer programming techniques. Also SAT is pretty much a solved problem. With algorithms like CDCL. This really surprised me. I also left my fi
348.
▲
by
ngruhn
3y ago
Ok fair enough. I suspect that's a pretty non-standard/rarely-used feature though. If you learn SQL you likely won't encounter this and I still contest the idea that SQL is a good entry into the logic paradigm. SQL and Prolo
349.
▲
by
ngruhn
3y ago
SQL has no recursion. I would argue that's a pretty fundamental aspect of Prolog, so I don't think SQL is a representative replacement.
350.
▲
by
ngruhn
4y ago
Maybe not ”equate“. Let’s say it’s 10.000 times less harmful. 3M/10k = 300. You owe that man 300 bucks.
351.
▲
by
ngruhn
4y ago
This is easier said then done. There are infinitely many edge cases to this and it’s also unclear how to even define “harm”. Should you give CPR at the risk of breaking bones in the chest? Probably yes. But that means “inflicting serious in
352.
▲
Why Open Source?
(opensource.google)
8 points
by
ngruhn
6y ago
|
0 comments
353.
▲
What makes a programming language Turing complete?
(dev.to)
2 points
by
ngruhn
7y ago
|
0 comments
354.
▲
What makes a programming language Turing complete?
(dev.to)
1 points
by
ngruhn
7y ago
|
0 comments
355.
▲
What makes a programming language Turing complete?
(dev.to)
3 points
by
ngruhn
7y ago
|
0 comments
356.
▲
by
ngruhn
7y ago
I agree with crimsonalucard but for different reasons. This book is catalog. It's like reading a dictionary from start to finish. This becomes dull fast and you don't learn efficiently. Sure you can just use it to look a pattern u
357.
▲
When “naming things” is done right
(github.com)
2 points
by
ngruhn
7y ago
|
0 comments
358.
▲
Naming things is hard. These names are pretty good though
(github.com)
3 points
by
ngruhn
7y ago
|
0 comments
359.
▲
When “naming things” is done right
(github.com)
17 points
by
ngruhn
7y ago
|
5 comments