thesz

41 ms·

751.
by thesz 4y ago
Exactly what I needed, thank you again very much! My old idea was to perform planning after some of the work has been done, because remaining statistics can be different. These papers are of great help!
752.
by thesz 4y ago
Thank you, second link of yours starts with the explanation of benefits expected, which is great. The difference is not exponential, if I may nitpick. It is sublinear in the case of the "triangles example" - WCO would produce O(n^
753.
by thesz 4y ago
The paper you provided has two important omissions: 1) it does not mention Tseitin transformation to encode Disjunctive Normal Form into a Conjunctive Normal Form and 2) does not look at decision diagrams, especially, zero-suppressed decisi
754.
by thesz 4y ago
And how modern SAT solving algorithms are fundamentally very similar to worst case optimal join algorithms? There are at least two different types of them, conflict-derived clause learning and variants and stochastic search and variants. Wh
755.
by thesz 4y ago
>The query plan produced by combining binary joins is always going to be off by up to an exponential factor when compared to a WCO join. Citation greatly needed. Why is it so?
756.
by thesz 4y ago
I think you are right about STM being roughly equivalent to snapshot isolation. What STM offers is an easy way to invent "containers for snapshotted values" aka TVars. Using them carefully may result in better scaling: https:&#x2
757.
by thesz 4y ago
"If you build something like that before". I think I can add that to the list of famous last words. ;) Please, excuse my sarcasm again. But, tell me what to do if I didn't built something like this before? What if I built som
758.
by thesz 4y ago
"Estimate the cardinality", "jaccard index", "succinct data structure" and, finally, some unknown abbreviation "WCO" (I guess, it stands for "worst case optimal"). Yes, of course, having imp
759.
by thesz 4y ago
IMNSHO query planning is pretty hard. I recently found exponential behavior in SELECT query processing that depends on the depth of subselects. This happened with pretty seasoned database system, let me say. To have good query optimization,
760.
by thesz 4y ago
You can extend or shrink circular list on the go, depending on needs. You can plan to divide memory ahead of time, but you don't have to.
761.
by thesz 4y ago
[1] https://www.folklore.org/StoryView.py?story=Negative_2000_Li... One of my tasks as a software engineer is to reduce code as much as possible. Because code is a liability, it needs to be supported, maintained, adapted, p
762.
by thesz 4y ago
As I mentioned elsewhere, words are read as if they are hieroglyphs [1]. [1] https://www.mrc-cbu.cam.ac.uk/people/matt.davis/cmabridge/ You used monadic interface, instead you may use applicative interface. l
763.
by thesz 4y ago
I have several questions about your APL example. Why did you use (foldl1 (+)) instead of sum? Also, (fromIntegral . length) is (genericLength) - and that means you used implicit type conversion which may add terseness and also lead to error
764.
by thesz 4y ago
What I did was not even at syntax level. These are lexems that were changed, a level below syntax. When you use C, you can write "~ x" and you can also write "??- x" [1], a slightly more verbose version of the same thing
765.
by thesz 4y ago
I glad you liked it. The transformation employed is used in application of Halstead metric [1] to various programming languages. [1] https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.106... APL/K and concat
766.
by thesz 4y ago
Joy allows to return a concatenation on top of stack. That's a single element that can contain several elements, just like tuple in Haskell.
767.
by thesz 4y ago
Add spaces around APL operators and name them. You examples become: 2 partial mod 1 minus 2 partial mod > partial 4 I guess your examples still need some framing to make them somehow passable around, for example, a definition
768.
by thesz 4y ago
Maximal size of executable is 2MB. So, it is not possible to torture it with the ghc-compiled Haskell program.
769.
by thesz 4y ago
The meta-interpretation will not say anything more than "this query may modify facts' database". Anything above that requires actual interpretation with rollback of changes. Because, you know, of halting theorem. Last time I
770.
by thesz 4y ago
Yes, they do. So what? They are essentially equivalent to two separate statements, a query and a DML statement, executed inside transaction. Meanwhile Prolog does not even have a notion of transactions.
771.
by thesz 4y ago
For me it is the other way around. Prolog allows effects on its database while executing the "query" - you can add or remove facts from database. SQL prohibits that, separating queries and data manipulation statements. And, of cou
772.
by thesz 4y ago
Ideally, you would like to have a specification of the system that can be translated into C and TLA+. This way it is harder to introduce bugs - it is hard to compile conditional or arithmetic operator differently in different places and it
773.
by thesz 4y ago
>Speed Bitcoin has Lightning network which is peer-to-peer and is quite fast. >Security It is up to you on how to generate your keys. You can use your passport number combined with whatever, you can split your secret between notaries
774.
by thesz 4y ago
Absolutely second this. Debug.Trace can use event log of RTS which is so cheap it is hard to believe.
775.
by thesz 4y ago
I think you are exaggerating for some reason. You said you have decent amount of Forth and Haskell for some reason not even compare to Forth. The very fact that you can have typed Forth in Haskell shows that type system is a very good too
776.
by thesz 4y ago
It is possible to produce a dump of Rust program AST into WhyML datatypes and/or functions and project and prove what can be proven. The structure of WhyML datatypes and functions can be parsed and transpiled back into Rust.
777.
by thesz 4y ago
Weight resistance training, mostly. Also occasional Tabata squats for some endurance. I found that I recover from quite intensive sets faster when training fasted. The decline in performance I experience can be explained by my age and, fran
778.
by thesz 4y ago
So do smaller models and I have to note smaller models are better at that.
779.
by thesz 4y ago
As I said elsewhere here, it is not the case for me - I quite often experience food aversion after exercise (weight training). I exercise in fasted state, 14-18 hours of fast. If exercise is especially hard, I found food not attractive at a
780.
by thesz 4y ago
For several years I exercise in fasting state, 14-18 hours of fasting. I can easily not eat for three hours after exercise. Actually, I experience no hunger at all. Could just be conditioning. Sample size of one.

More ›