Jaxan

27 ms·

391.
by Jaxan 8y ago
You can solve for any of the variables (you can select the variable, or just leave one field empty). It's not very clear though, and it does not give all solution. Also, you're in for a surprise if you search for Fibonacci. It giv
392.
by Jaxan 8y ago
Well, then you came pretty far already. This post is not a tutorial on monads. It’s really his thoughts on why he sees monads are needed in Haskell. (And not needed in, for example, ML.)
393.
by Jaxan 8y ago
I see. That makes some sense now. Thanks!
394.
by Jaxan 8y ago
So where is the part about the “best choice”? Two player games to me are all about quantifiers. If the opponent plays, it means we have to prove a “for all”. (This includes all worst case scenarios obviously.) And own plays are “exist” (jus
395.
by Jaxan 8y ago
It is important to really pause the videos at some points and do the "exercises". Doing the exercises is always a very important part of learning (I believe this holds in any field). Do them with pen and paper, not just in your he
396.
by Jaxan 8y ago
A related result is that java generics are Turing complete [1]. As a result you can write programs which will loop the type checker! I was at the popl presentation where the author showed this result. He gave a demo where he defined a Turin
397.
by Jaxan 9y ago
On the other hand, it has 100% coverage and zero vulnerabilities! We really should teach people how to test properly and not just use metrics to sell a library :-(.
398.
by Jaxan 9y ago
There are attacks where all pixels are just slightly changed and the classification is completely wrong. Think of changing all pixels by just the least significant bit. Still these changes are invisible to (my) human eye. Basically, each di
399.
by Jaxan 9y ago
You make it sound a bit too easy “just add some random colours”. But there are theoretical hardness results from the 90s on learning NN. It is so-called inherently unpredictable. These hardness results became a bit obsolete by big data. I b
400.
by Jaxan 9y ago
It abstracts away roads by using a graph as input (in the general case). In the post the author tackles the Euclidean TSP, where points are given by coordinates and you can freely travel.
401.
by Jaxan 9y ago
It does not “solve” it though. It’s not even an approximation (which is also NP-hard in the general case, not sure about the Euclidean case).
402.
by Jaxan 9y ago
Why not both? I think OP means that we should be nice and honest.
403.
by Jaxan 9y ago
Putting a bit more into the README has my preference. Often I come acros repos with “I cloned xxx with yyy”, where I have never heard of xxx. It only takes a bit more to briefly explain xxx.
404.
by Jaxan 9y ago
Thanks for writing this so clearly. It also captures my personal view on the matter. I have not been involved in such research, but friends of mine have. So I have been looking at it on the side, concluding what you wrote.
405.
by Jaxan 9y ago
This is how we do it in NL. We constantly monitor what's behind and to the side of us.
406.
by Jaxan 9y ago
I think the equivalent is packages which provide annotations. There are plentiful of such packed providing variations of "notNull". It seems even worse than extensions, as they are third party.
407.
by Jaxan 9y ago
I don't think it's fair to force English upon people. It's not even the most spoken language on the planet. (There is more people speaking Chinese. And also more people speaking Spanish than English.)
408.
by Jaxan 9y ago
A nice project using F* is the project Everest: https://project-everest.github.io . They implement HTTPS and all of its crypto, completely verified.
409.
by Jaxan 9y ago
One difference with Coq is that in Coq everything is constructive. A proof of a precondition is an object and has to be constructed in F* you could use classical logic, things are proven by a solver. (I might be wrong.)
410.
by Jaxan 9y ago
I never understood why people insist of having a single language for all parts of development. Most developers already (should) speak a few languages, so one extra is fine, I guess. I strongly believe in DSLs.
411.
by Jaxan 9y ago
To me, markdown and org-mode look completely equivalent. Surely there are small differences, which have to be learnt. Either way you have to remember some small details.
412.
by Jaxan 9y ago
I'd argue that if you are writing text, you'll put the description first and then look up the link. Because the description is often part of the sentence, and the link is not.
413.
by Jaxan 9y ago
So the argument that it is easy to write in any editor is not completely true then?
414.
by Jaxan 9y ago
Ah yes, of course!
415.
by Jaxan 9y ago
If you only get z shapes (with the same orientation). Is it then possible to avoid gaps? This is not clear to me at all.
416.
by Jaxan 9y ago
That one only seems to deal with the median, though.
417.
by Jaxan 10y ago
I used to play with this as a kid. I couldn't script it, but I could remove the headers from a bmp and add the headers for a wav in a hex editor. Then I tried all the effects in audacity. The resulting images were pretty cool (only gra
418.
by Jaxan 10y ago
The ML programming language, of course. I'm always confused when ML stands for machine learning, because I think the post will be about programming languages, but isn't.
419.
by Jaxan 10y ago
Cool! I really like the animations!
420.
by Jaxan 10y ago
Your thesis on maths is incorrect. Indeed, the way it is th aught uses a single language (just like introductions to compsci uses c-like languages). But professionals in different areas of maths use very different languages and tools. Resul

More ›