maweki

15 ms·

121.
by maweki 4y ago
What are the licensing issues with First-order Horn clause logic? Datalog is not a licensed product or software, the same way Answer Set Programming isn't.
122.
by maweki 4y ago
The main reasons I'd say are the very intuitive JOINs and queries. Like you give some partial relation and you get every "fit". So as long as you mostly do equalities in JOIN and WHERE, the queries will be very intuitive and
123.
by maweki 4y ago
By the fourth attempt the author seems to be half on the way to inventing typeclasses.
124.
by maweki 4y ago
"Compiling" down the product to a fold brings you to the same issue. Though of course it's a lot easier to reason about math in functional programming than in imperative programming, you still lose some of the equational prop
125.
by maweki 4y ago
Is it common for the HN audience to be able to fabricate their own PCBs? I believe none of my local hacker spaces have fabrication facilities. Whenever I see that, it means having to pay somebody quite a bit instead of do it yourself.
126.
by maweki 4y ago
Probably not. In Germany you have to show an excerpt of the menu (including prices) outside the restaurant. Usually the owners prop one or two of the middle pages of the menu and a page of the seasonal menu in a wall display by the entrance
127.
by maweki 4y ago
Sorry, same. There's such a myriad of e-learning platforms in Germany and I guess it's the same for most countries. I would believe the same goes for our own research static analysis and autotrading platform (in our case SQL) whic
128.
by maweki 4y ago
Though I don't really like you advertising, thank you for the suggestion. As a computer science researcher I'll give you some feedback why your application is a total deal-breaker for me and my colleagues: * It's not running
129.
by maweki 4y ago
Pandoc is a great piece of software. As a university teacher and researcher, I use it in three ways: 1. I write markdown for my website and for the websites for my research projects and simply generate standalone html out of it. Done. 2. Wh
130.
by maweki 4y ago
In this case, it's even worse. Prolog is computationally complete. With everything that comes with rice's theorem. Every non-trivial property of a program being generally undecidable. Datalog, on the other hand, isn't. It&#x2
131.
by maweki 4y ago
In western Germany we say "quarter to four" and in eastern Germany we say "three quarters (of) four".
132.
by maweki 4y ago
> everyone can understand it The recurrence relation of range(n)=range(n-1):n is easily understood and also already the naive functional implementation. These kinds of recursive/recurrence definitions are part of K12 curriculae, and
133.
by maweki 4y ago
> Last time I checked SQL was proven to be Turing-Complete? Without recursive CTEs, it isn't. And there's nothing much to prove about that. Finite SQL statements on finite databases always terminate and it's therefore not
134.
by maweki 4y ago
> could easily have asked instead, where do you draw the line? The commenter made that quite clear. Using a computational model that's not complete can not be called "programming" in any real-world context. Which is weird.
135.
by maweki 4y ago
I very much think that's a great approach. Though the outside language kinda needs to be static as well for this to be really useful. For SQL I'm impressed with Jooq on Java. The DSL created, barring some shenanigans, doesn't
136.
by maweki 4y ago
> and there are in fact examples of non-TC languages, if only educational Sure, SQL is only educational or not programming. There seems to be a lot of programming going on in the world generating a lot of value which you wouldn't re
137.
by maweki 4y ago
That doesn't solve the most problematic part of regexing for me: having a different programming language embedded as a string in my other source code. The same happens with SQL in many codebases. The embedded string is often precluded
138.
by maweki 4y ago
I truly believe that a blog post recapping my personal experience and a paper submitted to a conference have different standards of rigor. At least my blog posts have little less rigor than my scientific publications. But that might just be
139.
by maweki 4y ago
> some kind of weird conspiracy theory that there was no systematic problem in children murdered in those orphanages and schools in Canada GPR is not magic. When ground penetrating radar does show a disturbance, that is not proof of a bu
140.
by maweki 4y ago
Yeah, that's exactly the passage. Completely unquotable, therefore I usually paraphrase a bit.
141.
by maweki 4y ago
Turing said, that while you never know whether somebody else actually thinks or not, it's still polite to assume.
142.
by maweki 4y ago
You can work as much as you want if you're self-employed. But regular employee contracts are limited to full-time. Overtime is not allowed to be regularly above the weekly limit. As a full-time student you're not allowed to work m
143.
by maweki 4y ago
Yes. You're right. And I still think it's a bit easier in the short term to implement worker protection than a worldwide anti-capitalist revolution.
144.
by maweki 4y ago
Well, if you're asking whether capitalism and economic necessities are the root of most of our problems, then my answer is a resounding yes.
145.
by maweki 4y ago
How do you really know that the person selling sex really wants to and isn't consciously or unconsciously forced by it by the economic circumstances?
146.
by maweki 4y ago
I'm always split on this discussion about the Nordic Model. What about the people who really _want_ to do this? But the freedom for one person turns to economic necessity for another. And the author notes that ("I had to get the m
147.
by maweki 4y ago
Another view of Datalog, the underlying language, is a graph database with nodes of one verb and an arbitrary amount of objects/subjects. The query language only allows fixed verbs, but it has a built-in reasoning engine that lets you
148.
by maweki 4y ago
It's undecidable whether there even is an import of stuff. It's every non-trivial property that's undecidable. So the question whether a certain line is reached is as undecidable as the question what values can arguments have
149.
by maweki 4y ago
> It's pretty easy [...] to avoid this kind of detection. And by rice's theorem, it is generally undecidable whether there are hidden modules loaded. Static (or in this case maybe not so static) analysis of arbitrary code will
150.
by maweki 4y ago
So to get 1-6 you only need two sources of 1-6?

More ›