maweki

46 ms·

481.
by maweki 8y ago
The minimal herbrandt model does not have new atoms. Besides what is given in the rules and the starting facts (empty for least fix point). So the "biggest" model is only as large as any atom in any position for any predicate and
482.
by maweki 8y ago
You are wrong. p(X) :- p(X). does usually not terminate in a top-down (Prolog) system but does in a bottom-up (Datalog) system. Datalog doesn't even allow terms as predicate arguments so of course you can't construct them of infin
483.
by maweki 8y ago
Datalog does not have a search strategy per se. The general "strategy" (or definition) is the fixpoint of the T_p operator that derives all one-step-derivable facts from the facts and the rules. The minimal model (result of deriva
484.
by maweki 8y ago
Datalog always terminates because there is no way to derive new atoms.
485.
by maweki 8y ago
I always remind myself that it's not an if-and-only-if with this argument: since there could always be another rule that is satisfied to make that fact true, it can't be iff.
486.
by maweki 8y ago
I think that just shows that the python language and some others la k another operator and not that + should not be commutative.
487.
by maweki 8y ago
The literal translation is just "radio cell query". But it's a very catchy word :D
488.
by maweki 8y ago
As far as I understand, every request has to be done with judicial approval, which is given every time since there's no mechanism to check for effectiveness after the fact and most judges have no clue how broad the request might be (an
489.
by maweki 8y ago
In Germany the "Funkzellenabfrage" ("reverse location" request by cell) provided by the providers is used quite often. On the last Chaos Communication Congress there was a talk about this and the police uses it quite fre
490.
by maweki 8y ago
I think about using OOP only in terms of the structure of my data. Is my data more easily represented using actual pointer loops or is it a tree structure? With immutable objects you can't easily create longer loops in data (self-refer
491.
by maweki 8y ago
But generators are inherently stateful and don't have referential transparency because of their consumption semantics.
492.
by maweki 8y ago
If someone says "I you can do in X whatever you can do in Photoshop" I immediately assume that they are only using a tiny fraction of Photoshop's functionality.
493.
by maweki 8y ago
It's also important whether the SATA controller is passed through USB or properly connected. Some boards have abysmal SATA performance because of that.
494.
by maweki 8y ago
I always wondered why the west didn't push a west german citizen to go to space with one of the later missions, given how much Jähn's flight was considered a success of socialism by eastern propaganda. Quite a propaganda qoup, I&#
495.
by maweki 8y ago
Then a million dollars is nothing. That's not even one graduate's earnings.
496.
by maweki 8y ago
Where does an instance of a come from in that case? A function of that type has no way to construct one.
497.
by maweki 8y ago
At first I thought the spiders' abilities were ballooning due to our electricity consumption and I was slightly afraid. But it's about their ability to balloon and electrical variation in altitude.
498.
by maweki 9y ago
Have they fixed the cantseeshit issue where environment would always occlude the player and items and enemies? I remember that this was an issue on initial release and the devs where adamant on not fixing that or even acknowledging the issu
499.
by maweki 9y ago
I wholeheartedly believed that the first approach was a popular npm library.
500.
by maweki 9y ago
This sounds fun. How did you handle the case where on a bisect both halves didn't trigger the AV on their own?
501.
by maweki 9y ago
This is neat. I wonder whether there is a faster approach using binary decision diagrams or a variant thereof. If the state transition were represented by a binary function, BDDs could allow for counting states without actually enumerating.
502.
by maweki 9y ago
Mentioning that this problem is generally undecidable would have been nice, together with an analysis of which heuristics are then used. As I see it, they more or less just time the loops and if it was running too long it's an infinite
503.
by maweki 9y ago
That does indeed implement grouping and alternative
504.
by maweki 9y ago
Which means that this CAN NOT BE USED TO ACCEPT REGULAR LANGUAGES. The language (a|b)*, any number of as or bs in any order, can not be descibed using that parser. "considerable simplification" sounds like it's kinda regex. I
505.
by maweki 9y ago
I was trying to convey that a sphere-sphere is an infinite amount of points with some unintuitive properties, like half the points are still an infinite amount. For a set of faces defined by an arbitrarily large but finite subset of points
506.
by maweki 9y ago
It doesn't actually work in 2D for infinity, just for arbitrarily large integers (and there is an infinite amount of them). If it actually were infinite, three "neighbouring" points wouldn't actually describe a face but
507.
by maweki 9y ago
What I find important to talk about is the narrative that "if you think your company hasn't been broken into, you just don't know it". Of course no system is 100% secure, but the narrative that it's inevitable anywa
508.
by maweki 9y ago
yeah. The :empty() pseudoclass should do the trick.
509.
by maweki 9y ago
You can run both. I do. Most benefit I get for my phones, tablets, and Smart TV with the DNS-block.
510.
by maweki 9y ago
The author gets a few names wrong. "The length of an array can be determined through the length variable of the array object[...]". `length` is a property and not a variable, otherwise it would be writable with the suggested seman

More ›